Category:Heap sort
Jump to navigation
Jump to search
worst-case optimal in-place comparison sorting algorithm based on the heap data structure  A run of heapsort sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting takes place, the heap tree structure is shown briefly for illustration. | |||||
| Upload media | |||||
| Instance of | |||||
|---|---|---|---|---|---|
| Discoverer or inventor |
| ||||
| Time of discovery or invention |
| ||||
| |||||
 | |||||
Media in category "Heap sort"
The following 31 files are in this category, out of 31 total.
Binary heap bottomup vs topdown.svg 1,687 × 609; 14 KB
Dong.PNG 303 × 271; 24 KB
Example Heap Orig.png 129 × 91; 767 bytes
Example Heap.png 126 × 87; 755 bytes
Heap Array.jpg 329 × 227; 74 KB
Heap Beispiel.jpg 329 × 174; 55 KB
Heap example1.png 1,047 × 510; 24 KB
Heap example2.png 1,049 × 512; 24 KB
Heap example3.png 1,049 × 512; 6 KB
Heap mat entspriechendem Tableau dozou.png 350 × 260; 14 KB
Heap sort algorithm-phase1.png 457 × 134; 4 KB
Heap sort algorithm-phase1.svg 429 × 126; 6 KB
Heap sort algorithm-phase2.png 457 × 143; 5 KB
Heap sort algorithm-phase2.svg 429 × 135; 7 KB
Heap sort example.gif 476 × 438; 276 KB
Heap Sort.gif 668 × 497; 5 MB
Heap Wurzel entfernt teil2.jpg 329 × 174; 53 KB
Heap Wurzel entfernt teil3.jpg 329 × 174; 53 KB
Heap Wurzel entfernt teil4.jpg 329 × 174; 53 KB
Heap Wurzel entfernt.jpg 329 × 174; 53 KB
Heap-icon-rounded.svg 512 × 256; 356 bytes
Heap-priority-queue-icon-rounded.svg 512 × 95; 374 bytes
Heapsort-example.gif 350 × 280; 645 KB
Heapsort.svg 708 × 622; 538 KB
HeapsortSampleAfter.svg 625 × 375; 15 KB
HeapsortSampleBefore.svg 625 × 375; 14 KB
Min-heap extract.svg 1,276 × 886; 20 KB
Min-heap heapify.svg 850 × 815; 15 KB
Principe tri par tas.svg 199 × 237; 139 KB
Sorting heapsort anim.gif 280 × 214; 274 KB
Vundong.PNG 820 × 616; 129 KB
