Added heapsort to use heap_up and heap_down.  Make a heap by incrementally adding each element to the heap via heap_up.  Then remove teh highest element, and swap it w/ the last element, and call heap_down to prioritize it correctly.  This process, will create a sorted list.
Merging conflicts.