Can anyone explain in clear terms how the heap sort works and how the Quicksort works. I understand bits and pieces of the two, but not totaly sure how they work.

Thank You,
D.R.