programming-for-dummies

Using Heap Sort 401
Heap sort dumps an unsorted list of data into the heap, always making sure
the highest value appears in the root node. Then this highest value in the
root node gets stored at the end of the list. Now the heap rearranges its
values once more, putting the highest remaining value in the root node,
repeating the process all over again, as shown in Figure 1-7.
32 50 94 68 46
Unsorted list
50
94
68
32
32
Remove highest value from root node
and place at the end of the list.
94
46
32
Temporarily store data in a heap
data structure where the root node
contains the largest value.
46
50
68
Remove lowest node
and move to the root node.
32 50 94 68 46
46
50
68
32
Swap values if the root node
value is less than one of its
child node values.
46
50
32
68
Sorted list
32 50 94 68 94
Remove highest value from root node and
place it in the last part of the unsorted list.
Figure 1-7:
Heap sort
uses a tree
data
structure to
sort and
store items
temporarily.
32
46
50 32
Swap values if the root node
value is less than one of its
child node values.
46
Swap values if the root node
value is less than one of its
child node values.
32
32
32
46
32 46 50 68 94 Sorted list
32 46 50 68 94 Final sorted list
Sorted list
50
32 50 94 68 94
Sorted list
46
32 50 50 68 94
Book IV
Chapter 1
Sorting Algorithms