Closed Ananyashetty7 closed 2 weeks ago
š 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!
ā This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!
:red_circle: Title :
Heap Sort Visualizer With Time Complexity Analysis
:red_circle: Aim :
The aim is to create an interactive visualizer for the Heap Sort algorithm, allowing users to understand how Heap Sort works step by step. The project will also include time complexity analysis for each phase of the sorting process.
:red_circle: Brief Explanation :
Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements efficiently. This project will implement the Heap Sort algorithm with a graphical representation of the process. Users will be able to see the heap being constructed, elements being extracted, and the array being sorted in real-time. The visualizer will also display time complexity information (Best, Worst, and Average cases) during each stage, providing an educational and interactive experience for users to learn the inner workings of Heap Sort.
Screenshots š·
N/A
:white_check_mark: To be Mentioned while taking the issue :
GSSOC Open Source Contributer
Happy Contributing š
All the best. Enjoy your open source journey ahead. š