Heap sort algorithm in Data Structures Theory - Time & Space Complexity

Time Complexity: Heap sort algorithm

O(n log n)

Understanding Time Complexity

Heap sort is a popular sorting method that uses a special tree structure called a heap.

We want to understand how the time it takes to sort grows as the list gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following heap sort code snippet.

function heapSort(array) {
  buildMaxHeap(array);
  for (let end = array.length - 1; end > 0; end--) {
    swap(array, 0, end);
    siftDown(array, 0, end - 1);
  }
}

function buildMaxHeap(array) {
  let start = Math.floor((array.length - 2) / 2);
  while (start >= 0) {
    siftDown(array, start, array.length - 1);
    start--;
  }
}

function siftDown(array, start, end) {
  let root = start;
  while (root * 2 + 1 <= end) {
    let child = root * 2 + 1;
    let swapIdx = root;
    if (array[swapIdx] < array[child]) swapIdx = child;
    if (child + 1 <= end && array[swapIdx] < array[child + 1]) swapIdx = child + 1;
    if (swapIdx === root) return;
    swap(array, root, swapIdx);
    root = swapIdx;
  }
}
    

This code sorts an array by first building a max heap, then repeatedly swapping the largest element to the end and fixing the heap.

Identify Repeating Operations

• Primary operation: The siftDown process that moves elements down the heap to maintain order.
• How many times: It runs once for each non-leaf node during heap building, and once for each element during sorting.

How Execution Grows With Input

As the list size grows, the number of operations grows in a way that is a bit more than linear but less than quadratic.

Input Size (n)	Approx. Operations
10	About 30 to 40 siftDown steps
100	About 700 to 800 siftDown steps
1000	About 10,000 to 12,000 siftDown steps

Pattern observation: The operations grow roughly proportional to n times the logarithm of n, meaning the work increases moderately as input grows.

Final Time Complexity

Time Complexity: O(n log n)

This means if you double the size of the list, the time to sort grows a bit more than double, but much less than square.

Common Mistake

[X] Wrong: "Heap sort is as slow as bubble sort because both swap elements repeatedly."

[OK] Correct: Heap sort smartly organizes data in a heap to reduce unnecessary comparisons, making it much faster than simple swapping methods like bubble sort.

Interview Connect

Understanding heap sort's time complexity helps you explain efficient sorting methods clearly, a skill useful in many coding discussions and real projects.

Self-Check

"What if we used a min heap instead of a max heap? How would the time complexity change?"

Practice

1. What is the main data structure used in the Heap sort algorithm to organize elements during sorting?

easy

A. Queue

B. Heap

C. Stack

D. Linked List

Solution

1. Step 1: Understand the core structure of Heap sort

   Heap sort organizes elements using a special tree-based structure called a heap.

2. Step 2: Identify the specific heap type used

   Heap sort uses a max heap to repeatedly extract the largest element for sorting.

3. Final Answer:

   Heap -> Option B

4. Quick Check:

   Heap = Heap sort main structure [OK]

Hint: Heap sort always uses a heap structure [OK]

Common Mistakes:

• Confusing heap with queue or stack
• Thinking linked list is used for sorting
• Assuming array is the main structure

2. Which of the following is the correct first step in the Heap sort algorithm?

easy

A. Build a max heap from the input array

B. Sort the array using bubble sort

C. Reverse the array elements

D. Split the array into two halves

Solution

1. Step 1: Identify the initial operation in Heap sort

   The algorithm starts by building a max heap from the unsorted input array.

2. Step 2: Understand why this step is important

   Building a max heap ensures the largest element is at the root, ready for extraction.

3. Final Answer:

   Build a max heap from the input array -> Option A

4. Quick Check:

   First step = Build max heap [OK]

Hint: Heap sort always starts by building a max heap [OK]

Common Mistakes:

• Confusing with other sorting algorithms like bubble sort
• Trying to reverse or split array first
• Skipping heap construction

3. Consider the array [4, 10, 3, 5, 1]. After building the max heap in Heap sort, what is the root element of the heap?

medium

A. 5

B. 4

C. 10

D. 3

Solution

1. Step 1: Build max heap from the array

   Heap sort builds a max heap where the largest element is at the root. For [4, 10, 3, 5, 1], 10 is the largest.

2. Step 2: Confirm root element

   After heapifying, 10 becomes the root element of the max heap.

3. Final Answer:

   10 -> Option C

4. Quick Check:

   Max heap root = largest element = 10 [OK]

Hint: Max heap root is always the largest element [OK]

Common Mistakes:

• Choosing first array element as root
• Confusing max heap with min heap
• Not heapifying properly

4. Identify the error in this Heap sort step: "After building the max heap, the algorithm swaps the root with the last element but forgets to heapify the reduced heap."

medium

A. Heapify must be called after each swap to maintain heap property

B. Heap sort does not use heapify at all

C. Swapping root with last element is not part of Heap sort

D. No error, this is correct

Solution

1. Step 1: Understand the Heap sort process after swapping

   After swapping the root with the last element, the heap property may break in the reduced heap.

2. Step 2: Identify the missing step

   Heapify must be called on the reduced heap to restore the max heap property before next extraction.

3. Final Answer:

   Heapify must be called after each swap to maintain heap property -> Option A

4. Quick Check:

   Heapify needed after swap [OK]

Hint: Always heapify after swapping root in Heap sort [OK]

Common Mistakes:

• Skipping heapify after swap
• Thinking swap alone sorts the array
• Confusing heapify with building heap

5. You have an array with many duplicate elements. How does Heap sort handle duplicates during sorting?

hard

A. Duplicates are kept in their original relative order (stable sort)

B. Heap sort removes duplicates automatically

C. Duplicates cause Heap sort to fail

D. Duplicates may change order because Heap sort is not stable

Solution

1. Step 1: Understand stability in sorting algorithms

   A stable sort keeps duplicates in original order; an unstable sort may reorder them.

2. Step 2: Analyze Heap sort stability

   Heap sort is not stable because heap operations can reorder equal elements arbitrarily.

3. Final Answer:

   Duplicates may change order because Heap sort is not stable -> Option D

4. Quick Check:

   Heap sort is unstable, duplicates reorder [OK]

Hint: Heap sort is not stable; duplicates can reorder [OK]

Common Mistakes:

• Assuming Heap sort is stable
• Thinking duplicates cause errors
• Believing duplicates are removed