heap sort from seymour lipschutz
ntations are also discussed. In-place Sorting: Heap sort sorts the array without requiring additional memory, making it space-efficient. Stability: Heap sort is inherently unstable because equal elements may change order during swaps. Code Example (in C-like pseudocode) ```c void heapSort