11.4.2. In-place Sorting with Heaps

Try these first

1. 1.

   What is a heap?

   Hint

   Think of its structure and its properties.

2. 2.

   How is 'delete max' performed?

   Hint

   What do you do with the last element?

3. 3.

   What is the time complexity of extracting the maximum value in a heap?

   • O(n)
   • O(log n)
   • O(1)

   Hint

   Think about how many levels are in a binary tree.

4. 4.

   True or False: The heap sort algorithm requires additional storage.

   • True
   • False

   Hint

   Recall how heap sort maintains its structure.

5. 5.

   Propose an outline for implementing an in-place heap sort algorithm from scratch. Highlight key steps.

   Hint

   Focus on the transition steps between building the heap and extracting elements.

6. 6.

   How would you modify a traditional heap to allow for dynamic priority changes without losing the heap properties? Describe your approach.

   Hint

   Reflect on Dijkstra’s algorithm and its need for efficient updates.