[Feature Request]: Adding Heap Sort in Sorting Algorithm

[ParasY1724]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

Heap Sort: This algorithm uses a binary heap data structure to sort elements, efficiently performing selection operations.

Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements efficiently. It operates in two main phases: first, it builds a max heap from the input array, where each parent node is greater than its child nodes. Then, it repeatedly removes the largest element (the root of the heap) and places it at the end of the array, while restructuring the heap to maintain its properties. This process continues until all elements are sorted. Heap Sort has a time complexity of O(n log n) and is in-place, requiring only O(1) additional space, making it suitable for scenarios where memory efficiency is important. However, it is not a stable sort, meaning equal elements may not retain their relative order.

Record

• I agree to follow this project's Code of Conduct
• I want to work on this issue
• I'm willing to provide further clarification or assistance if needed.

Full Name

Paras Yerunkar

Participant Role

GSSOC

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!