Heapsort – Step 1

• Arrange the elements in a heap

  • take a binary tree representation of the list and make a heap of it, i.e. if a node is smaller than one of its children, exchange with the larger children
  • this operation is done bottom-up