Heap Sort

Показать описание

Visualization and "audibilization" of the Heap Sort algorithm.
Sorts a random shuffle of the integers [1,100] using max-heap sort. First builds a heap in the array by sifting down smaller element. The levels of the heap are lightly colored once heapified.
The animation is slowed down during the video to give you time to see how the algorithm works.

Рекомендации по теме

Комментарии

I realize it's only a sort... but this scares me...

Jawunleashed

This sounds like a shitty digitalized violin concert at an elementary school

clemsonbagelman

I had some Christmas lights that used to sound like this video.

spendle

For anyone wondering
1) 0:00 ~ 0:28 array being built as a heap (usually by recursively calling heapify)
2) 0:28 swap root (A[0], aka largest element) with the n-th element, now the array is size n-1
3) 0:28 ~ 0:30 heapify (placing A[0] in proper position by comparing it to the different levels of the heap)
4) 0:30 ~ 1:29 repeat steps 2 and 3

nonosomi

1:05 when you die in NES Legend of Zelda

epsilonthedragon

Fun fact: There's a sorting algorithm called std::sort_heap which -simulates this without using a heap- is basically just this but it's not colored.

want-diversecontent

heap sort really has me with the spooky bleeps and bloops and colors but really not on the way it sorts

TarigonTetradactyl

Heap sort: Heapify. And then the sequence reaplce, and sift down, and repeat.

want-diversecontent

Sounds like an 8-bit horror game I'm scared now

banishingwarden

Me not knowing anything about sorting algorithms: "wow there's colors and crap"

codenamedmemphis

this is like selection sort, but optimized

raffimolero

The beginning sounds like a decommissioned merry go round jeez-

No actually I take that back. This whole thing is a decommissioned merry go round

dransnake