Content deleted Content added
Add Skiena's "Heapsort...is nothing but an implementation of selection sort using the right data structure" quote. |
Zestyarmor (talk | contribs) →Example: Modified the order of the example's unsorted list to more clearly illustrate the swapping step |
||
Line 28:
|-
| ()
| style="text-align:right;" | (
| 11
|-
| (11)
| style="text-align:right;" | (25,
| 12
|-
| (11, 12)
| style="text-align:right;" | (
| 22
|-
| (11, 12, 22)
| style="text-align:right;" | (25, 64)
| 25
|-
| (11, 12, 22, 25)
| style="text-align:right;" | (64)
| 64
|-
| (11, 12, 22, 25, 64)
| style="text-align:right;" | ()
|
|}
| |||