Heap Sort Analysis and Stability Demonstration

Heap Sort Analysis and Stability Demonstration: a task in Terminal-Lego-15k (Harbor dataset). In this task, you will explore why heap sort, despite its O(n log n) worst-case time complexity and O(1) space complexity, is not always the preferred sorting algorithm. You will implement heap sort and…

The task

In this task, you will explore why heap sort, despite its O(n log n) worst-case time complexity and O(1) space complexity, is not always the preferred sorting algorithm. You will implement heap sort and demonstrate the concept of sorting algorithm "stability" through practical code.

Part of PrimeIntellect/Terminal-Lego-15k.