The Heapsort Algorithm

• Based on inserting elements into a heap and removing them in sorted order
• This algorithm is an O(n log(n)) algorithm:
  • Each insertion and removal is O(log(n))
  • These steps are repeated n times, once for each element in the sequence that is to be sorted