Problem
This problem deals with sorting algorithms.
1. Explain the principal differences between the Insertion Sort and Heap Sort algorithms. Be certain you explain i. any requirements the algorithms have to be used, ii. a general idea of how the algorithms operate, and iii. which algorithm is the most efficient in the worst-case scenario. Your response should be 1-2 paragraphs in length.
2. Recall that the "standard" version of Heap Sort uses a separate array to build up the sorted values as elements are dequeued. Explain how this approach can be modified to permit Heap Sort to operate in place.