[Verse 1]
Binary tree's a twisted maze, nodes scattered wild and free
But heapsort brings the order, max-heap property
Parent dominates its children, largest value holds the throne
Every subtree follows suit, hierarchy full-grown
[Chorus]
Build it up, sift it down, heapify the array
Extract the max, swap it back, sorted elements stay
Logarithmic operations, efficiency supreme
Heapsort conquers chaos with its systematic scheme
[Verse 2]
Start by building from the ground, bottom-up we rise
Half the length minus one, that's where heapify applies
Bubble down the smaller nodes, compare with both your kids
Choose the largest of the three, let the greater value bid
[Chorus]
Build it up, sift it down, heapify the array
Extract the max, swap it back, sorted elements stay
Logarithmic operations, efficiency supreme
Heapsort conquers chaos with its systematic scheme
[Bridge]
Root contains the maximum, pluck it from the tree
Replace it with the final leaf, restore integrity
Shrink the heap by one position, partition what remains
Sorted tail grows longer while the heap domain wanes
[Verse 3]
In-place sorting algorithm, memory footprint tight
Not stable like merge sort, but performance feels just right
Worst case logarithmic, guaranteed consistent speed
When quicksort hits its nightmare, heapsort plants the seed
[Chorus]
Build it up, sift it down, heapify the array
Extract the max, swap it back, sorted elements stay
Logarithmic operations, efficiency supreme
Heapsort conquers chaos with its systematic scheme
[Outro]
From disorder into order, complete binary perfection
Heapsort demonstrates that structure breeds direction