✨ Add New Sorting Algorithms to the Visualizer

[Mr-G-D]

🧠 Feature Request: Add New Sorting Algorithms

We want to expand the capabilities of the Sorting Visualizer by including more sorting algorithms! 🚀

✅ What's Needed

Please contribute by implementing and visualizing one or more of the following algorithms (or suggest your own):

• Merge Sort ✔️
• Quick Sort
• Heap Sort
• Radix Sort
• Shell Sort
• Counting Sort
• Bucket Sort
• Cocktail Shaker Sort
• Comb Sort

---

🧩 Need Help?

Feel free to comment here or open a discussion thread. Happy to support your contributions!

Thanks for helping improve the project! 💙

Please add screenshots to better show your contributions.

[lourduradjou]

Hi there, can i add the sorting algorithms i know, i am interested to contribute , could you add me as an assignee to this issue.

[Mr-G-D]

Sure please let me know what algorithm you are willing to contribute. @lourduradjou

[easedu]

Hi! Do you still need help?

[trett1004]

Hi, nice visualization — thanks for sharing this project.
I forked the repo and implemented Merge Sort. Would you like me to make a pull request?

I also had the idea of adding a small running timer to the UI. If that’s of interest, I’d be happy to do it afterwards.

[Mr-G-D]

Hello @easedu , of course. But please take a look at the project setup and make sure if you are comfortable with the version numbers of the project.

[Mr-G-D]

Hello @trett1004
That's good to hear, please create a pull request.
Any ideas you have, open a feature development issue and contribute your work.
Thank you for your time.

[trett1004]

Hi Dinesh,
I opened a PR for a small insertion sort fix. The algorithm had an unnecessary outer loop, which increased complexity from O(n²) to O(n³).
Have a nice day!
Max

[Mr-G-D]

@trett1004
Thank you for your contribution, I appreciate your good eye to bugs.