Heap Sort Algorithm in DSA C# - Execution Trace

Concept Flow - Heap Sort Algorithm

Build Max Heap from array

↓

Extract max element (root)

↓

Swap root with last element

↓

Reduce heap size by 1

↓

Heapify root to restore max heap

↓

Repeat extraction until heap size is 1

↓

Sorted array in ascending order

Heap sort builds a max heap, then repeatedly extracts the largest element by swapping it to the end and restoring the heap until sorted.

Execution Sample

DSA C#

int[] arr = {4, 10, 3, 5, 1};
HeapSort(arr);
// Sorted array: 1, 3, 4, 5, 10

Sorts the array using heap sort, resulting in ascending order.

Execution Table

Step	Operation	Heap Size	Array State	Heap Visual (Tree)
1	Build max heap	5	[10, 5, 3, 4, 1]	10 / \ 5 3 / \ 4 1
2	Swap root with last element	5	[1, 5, 3, 4, 10]	1 / \ 5 3 / \ 4 10
3	Heapify root (index 0)	4	[5, 1, 3, 4, 10]	5 / \ 1 3 / 4
4	Swap root with last element	4	[4, 1, 3, 5, 10]	4 / \ 1 3 / 5
5	Heapify root (index 0)	3	[4, 1, 3, 5, 10]	4 / \ 1 3
6	Swap root with last element	3	[3, 1, 4, 5, 10]	3 / \ 1 4
7	Heapify root (index 0)	2	[3, 1, 4, 5, 10]	3 / 1
8	Swap root with last element	2	[1, 3, 4, 5, 10]	1 /
9	Heapify root (index 0)	1	[1, 3, 4, 5, 10]	1
10	Heap size 1, sorting done	1	[1, 3, 4, 5, 10]	1

💡 Heap size reduced to 1, array is fully sorted.

Variable Tracker

Variable	Start	After Step 1	After Step 3	After Step 5	After Step 7	Final
Heap Size	5	5	4	3	2	1
Array	[4,10,3,5,1]	[10,5,3,4,1]	[5,1,3,4,10]	[4,1,3,5,10]	[3,1,4,5,10]	[1,3,4,5,10]
Root Value	4	10	5	4	3	1

Key Moments - 3 Insights

Why do we swap the root with the last element before heapifying?

Swapping moves the largest element (root) to its correct sorted position at the end. Then heapify restores the heap property for the reduced heap (see steps 2 and 3 in execution_table).

Why does heap size reduce after each extraction?

Because the last element is now sorted and excluded from the heap operations. This is shown in variable_tracker where heap size decreases after each extraction.

Why do we heapify only the root after each swap?

Because only the root might violate the heap property after swapping. Heapify fixes this by pushing the root down to correct position (see steps 3, 5, 7, 9).

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what is the root value after heapify?

A 5

B 1

C 10

D 4

💡 Hint

Check the 'Root Value' in variable_tracker after step 3.

At which step does the heap size become 2?

A Step 5

B Step 8

C Step 7

D Step 9

💡 Hint

Look at the 'Heap Size' row in variable_tracker.

If we skip heapifying after swapping root with last element, what happens?

A Array remains sorted

B Heap property breaks, sorting fails

C Heap size increases

D Root value stays the same

💡 Hint

Refer to steps 3, 5, 7 where heapify restores heap property.

Concept Snapshot

Heap Sort Algorithm:
- Build max heap from array
- Swap root (max) with last element
- Reduce heap size by 1
- Heapify root to restore max heap
- Repeat until heap size is 1
- Result: sorted array in ascending order

Full Transcript

Heap sort works by first building a max heap from the input array. The largest element is at the root. We swap this root with the last element, then reduce the heap size to exclude the sorted element. Next, we heapify the root to restore the max heap property. This process repeats until only one element remains in the heap. The array ends up sorted in ascending order. Key points include swapping root with last element before heapifying, reducing heap size after each extraction, and heapifying only the root after each swap to maintain heap structure.

Practice

1. What is the main purpose of the heapify function in the Heap Sort algorithm?

easy

A. To build a max heap from an unordered array

B. To swap the first and last elements of the array

C. To reverse the array after sorting

D. To count the number of elements in the array

Solution

1. Step 1: Understand heapify's role

   The heapify function rearranges elements to satisfy the max heap property, where each parent node is greater than its children.

2. Step 2: Connect heapify to building max heap

   Heapify is called repeatedly to build a max heap from an unordered array before sorting begins.

3. Final Answer:

   To build a max heap from an unordered array -> Option A

4. Quick Check:

   heapify builds max heap = A [OK]

Hint: Heapify creates max heap structure before sorting [OK]

Common Mistakes:

• Confusing heapify with swapping elements
• Thinking heapify reverses the array
• Assuming heapify counts elements

2. Which of the following is the correct way to swap two elements arr[i] and arr[j] in C# during heap sort?

easy

A. swap(arr[i], arr[j]);

B. int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp;

C. arr[i], arr[j] = arr[j], arr[i];

D. arr[i] = arr[j]; arr[j] = arr[i];

Solution

1. Step 1: Identify correct C# swap syntax

   In C#, swapping requires a temporary variable to hold one value during exchange.

2. Step 2: Check each option

   int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; uses a temporary variable correctly. arr[i], arr[j] = arr[j], arr[i]; is Python syntax. swap(arr[i], arr[j]); is invalid without a swap method. arr[i] = arr[j]; arr[j] = arr[i]; overwrites values incorrectly.

3. Final Answer:

   int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; -> Option B

4. Quick Check:

   Use temp variable to swap in C# = C [OK]

Hint: Use temp variable to swap in C# [OK]

Common Mistakes:

• Using Python tuple swap syntax in C#
• Calling undefined swap function
• Overwriting values without temp variable

3. What will be the output array after applying heap sort on int[] arr = {4, 10, 3, 5, 1};?

medium

A. [5, 10, 4, 3, 1]

B. [10, 5, 4, 3, 1]

C. [1, 4, 3, 5, 10]

D. [1, 3, 4, 5, 10]

Solution

1. Step 1: Build max heap from array

   Starting array: [4, 10, 3, 5, 1]. Max heap after heapify: [10, 5, 3, 4, 1].

2. Step 2: Extract max and sort

   Swap 10 with last element, heapify reduced heap: [5, 4, 3, 1, 10]. Repeat until sorted: final sorted array is [1, 3, 4, 5, 10].

3. Final Answer:

   [1, 3, 4, 5, 10] -> Option D

4. Quick Check:

   Heap sort sorts ascending = [1, 3, 4, 5, 10] [OK]

Hint: Heap sort outputs sorted ascending array [OK]

Common Mistakes:

• Confusing max heap with sorted array
• Forgetting to heapify after swaps
• Assuming heap sort outputs descending order

4. Identify the error in this heap sort snippet:

void HeapSort(int[] arr) {
  int n = arr.Length;
  for (int i = n / 2 - 1; i >= 0; i--) {
    Heapify(arr, n, i);
  }
  for (int i = n - 1; i > 0; i--) {
    int temp = arr[0];
    arr[0] = arr[i];
    arr[i] = temp;
    Heapify(arr, n, 0);
  }
}

void Heapify(int[] arr, int n, int i) {
  int largest = i;
  int left = 2 * i + 1;
  int right = 2 * i + 2;
  if (left < n && arr[left] > arr[largest]) largest = left;
  if (right < n && arr[right] > arr[largest]) largest = right;
  if (largest != i) {
    int swap = arr[i];
    arr[i] = arr[largest];
    arr[largest] = swap;
    Heapify(arr, n, largest);
  }
}

medium

A. Heapify call inside second loop uses wrong size parameter

B. The first for loop should start from n/2, not n/2 - 1

C. The second for loop condition should be i >= 0, not i > 0

D. Swap logic inside Heapify is incorrect

Solution

1. Step 1: Examine the second loop's Heapify call

   After swapping arr[0] and arr[i], the effective heap size is i. However, the code calls Heapify(arr, n, 0), using the original full size n instead of the reduced size i. This is the error.

2. Step 2: Confirm other options are not errors

   The first for loop should start from n/2, not n/2 - 1 is incorrect because it correctly starts at n/2 - 1. The second for loop condition should be i >= 0, not i > 0 is wrong because i > 0 is appropriate. Swap logic inside Heapify is incorrect is false; the swap is correct.

3. Final Answer:

   Heapify call inside second loop uses wrong size parameter -> Option A

4. Quick Check:

   Heapify in extract phase uses reduced size i, not n = B [OK]

Hint: Check loop bounds and heapify size carefully [OK]

Common Mistakes:

• Changing loop start incorrectly
• Using wrong loop end condition
• Misunderstanding heap size in heapify

5. Given a large array with many duplicate values, which modification to the standard heap sort algorithm can improve its stability (preserving order of equal elements)?

hard

A. Use a min heap instead of a max heap

B. Sort the array twice with heap sort

C. Add an index field to elements and compare indices when values are equal

D. Skip heapify calls for duplicate values

Solution

1. Step 1: Understand stability in sorting

   Stability means equal elements keep their original order after sorting.

2. Step 2: Analyze heap sort stability

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

3. Step 3: Find modification to improve stability

   Adding an index field and comparing indices when values are equal preserves original order, making heap sort stable.

4. Final Answer:

   Add an index field to elements and compare indices when values are equal -> Option C

5. Quick Check:

   Use index to preserve order for stability = D [OK]

Hint: Use original indices to maintain stability in heap sort [OK]

Common Mistakes:

• Thinking min heap makes sort stable
• Skipping heapify breaks heap property
• Sorting twice wastes time without stability