Heapsort
	• A better approach is to put all of the numbers in a binary tree -- in the order you received them. • Then, perform the algorithm we used to adjust the heap after deleting an item. • This will cause the smaller numbers to trickle down to the bottom.