Heap Sort is for Nothings

Because, let's be real, it's not like it's efficient or anything.

Heap sort is the worst. It's like trying to sort a bunch of cats by their favorite foods.

It's got a time complexity of O(n log n), but who needs to know that when you're just trying to sort a few items.

• Why not use Bubble sort instead? It's like, totally better.
• Or Quicksort? No one needs speed.
• Or even Insertion sort? Who cares about being sorted at all?