I am assuming that you want to sort in Ascending Order, so i am going to use Max Heap.
Pick to Root and Replace it with Last Node
Heapify with size less than 1 as the last element is in correct place.
24,15,11,7,3,1,8,2,5
15,7,11,5,3,1,8,2,24
11,7,8,5,3,1,2,15,24
8,7,2,5,3,1,11,15,24
7,5,2,1,3,8,11,15,24
5,3,2,1,7,8,11,15,24
3,1,2,5,7,8,11,15,24
2,1,3,5,7,8,11,15,24
1,2,3,5,7,8,11,15,24