Skip to content

Latest commit

 

History

History
62 lines (41 loc) · 2.05 KB

README.md

File metadata and controls

62 lines (41 loc) · 2.05 KB

Sorting Algorithm Visualizer

Welcome to the Sorting Algorithm Visualizer, an interactive tool to help you understand how various sorting algorithms work step by step. The project visualizes sorting algorithms in real-time, making it easier to learn the process behind each algorithm and compare their performance.

🚀 Features

  • Real-time Visualization: Watch how different sorting algorithms manipulate data step-by-step.
  • Clean UI: Clean and Clear UI for no distraction and smooth learning experience.
  • Supported Algorithms: Visualize popular sorting algorithms such as:
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort, Randomized Quick Sort
    • Heap Sort
    • Radix Sort
    • Shell Sort
  • Customizable Inputs: Adjust the array size and speed of sorting to customize your learning experience.
  • Pseudo-Code: Pseudo Code for each algorithm available.
  • Code Implementation: Each algorithm implemented in 5 different programming languages with dummy example run.

🌟 Demo

Check out the live version of the Sorting Algorithm Visualizer here: Sorting Algorithm Visualizer

🛠️ Tech Stack

The Sorting Algorithm Visualizer is built using the following technologies:

  • Frontend:
    • HTML, CSS, JavaScript

📄 Contributing

If you'd like to contribute to Sorting Algorithm Visualizer, feel free to fork the repository and submit a pull request. Here's how:

  1. Fork the repository
  2. Create a new branch for your feature or bugfix (git checkout -b feature-name)
  3. Commit your changes (git commit -am 'Add new feature')
  4. Push to the branch (git push origin feature-name)
  5. Open a pull request

📬 Contact

For any questions, issues, or suggestions, feel free to reach out to me directly or open an issue.

Thanks for checking out Sorting Algorithm Visualizer! Happy learning! 🎉