Programmer's Picnic • Heap Sort

Heap Sort

Builds a max-heap, repeatedly removes the largest element, and places it at the end.

Visualizer

Numbered boxes show both the value and its current position number. Movement is animated from one slot to another. For divide-and-conquer algorithms, the page also shows how the list splits into parts and then comes back together.

compare swap / move fixed / merged

Dry run

Divide-and-conquer view

This area becomes especially useful for Merge Sort, Quick Sort, and TimSort-style run/merge explanation. It visually shows parts, subparts, pivot-based partitions, or natural runs depending on the algorithm.

Complexity and notes

Best
O(n log n)

Average
O(n log n)

Worst
O(n log n)

Stable
No

In-place
Yes

Type
Core / Counting / Heap

Tip: try arrays with duplicates and partially sorted values. Watching the movements helps understand why some algorithms preserve order and some do not.

Python code

import heapq

def heap_sort(arr):
    heap = arr[:]
    heapq.heapify(heap)
    return [heapq.heappop(heap) for _ in range(len(heap))]

Embedded Python editor via share-hash

The editor URL below has been updated to remove lesson-viewer. The code is packed into the hash so the editor can load a ready example directly.