previous | start | next

Self Check

  1. Which algorithm requires less storage, heapsort or mergesort?
  2. Why are the computations of the left child index and the right child index in the HeapSorter different than in MinHeap?

previous | start | next