11.1.2. Using Heaps for Sorting

Try these first

1. 1.

   What is a heap?

   Hint

   Think about the relationships between parents and children in the structure.

2. 2.

   What is the time complexity for building a heap?

   Hint

   Remember the steps involved in creating the heap from an array.

3. 3.

   What is the primary use of heaps?

   • To sort data
   • To store elements in a linear fashion
   • To implement priority queues
   • To represent graphs

   Hint

   Consider how you would prioritize tasks in real-life applications.

4. 4.

   True or False: Heap sort has a time complexity of O(n^2).

   • True
   • False

   Hint

   Recall how sorting with heaps operates compared to other methods.

5. 5.

   Given the array [10, 15, 30, 5, 20, 25], build a max heap and explain each step in the process.

   Hint

   Focus on where swaps may occur.

6. 6.

   Devise a scenario where heaps can significantly improve performance compared to sorting methods like bubble sort.

   Hint

   Think about how often data changes and how fast you need that information.