Skip to content

AlgoSort Sorting Visualizer is an interactive web application that visually demonstrates various sorting algorithms, such as Bubble Sort, Merge Sort, Quick Sort, and more. It allows users to adjust array size and sorting speed, offering an engaging way to understand and compare the performance of sorting techniques through animations.

Notifications You must be signed in to change notification settings

shivpr23/AlgoSort-Sorting-Visualiser

Repository files navigation

Sorting Visualizer

Sorting Visualizer is an engaging and interactive web application that brings sorting algorithms to life with vivid visual representations. Whether you're learning about algorithms or just exploring, this tool makes understanding sorting algorithms easy and fun.

🌟 Features

  • Intuitive Visualizations: Each algorithm comes to life with colorful animations.
  • Interactive Controls: Adjust array size and sorting speed dynamically.
  • Algorithm Insights: Compare algorithms by observing their performance visually.
  • Educational: Gain insights into the time and space complexity of each sorting algorithm.

🛠 Installation

Prerequisites

Make sure you have the following installed on your system:

  • Node.js (v14 or later recommended)
  • npm (comes with Node.js)

Steps

  1. Clone the repository:
    git clone https://github.com/your-username/sorting-visualizer.git
  2. Navigate to the project directory:
    cd sorting-visualizer
  3. Install the dependencies:
    npm install
  4. Start the development server:
    npm start
    Open AlgoSort-Sorting-Visualiser in your browser to view the application.

🎮 Usage

  1. Open the application in your browser.
  2. Select your preferred sorting algorithm from the dropdown menu.
  3. Use sliders to:
    • Adjust the size of the array.
    • Modify the sorting speed.
  4. Click the Start button to begin the visualization.

💻 Technologies Used

  • React: For building the dynamic user interface.
  • CSS: For creating responsive and engaging visuals.
  • JavaScript: For implementing efficient sorting algorithms.

🔍 Sorting Algorithms

Bubble Sort

  • Time Complexity: O(n²)
  • Space Complexity: O(1)

Merge Sort

  • Time Complexity: O(n log n)
  • Space Complexity: O(n)

Insertion Sort

  • Time Complexity: O(n²)
  • Space Complexity: O(1)

Selection Sort

  • Time Complexity: O(n²)
  • Space Complexity: O(1)

Quick Sort

  • Time Complexity: O(n log n) (average case)
  • Space Complexity: O(log n)

Heap Sort

  • Time Complexity: O(n log n)
  • Space Complexity: O(1)

📸 Screenshots

(Add screenshots of your application here to make the README more engaging!)


🤝 Contributing

Contributions are always welcome! Here's how you can contribute:

  1. Fork the repository.
  2. Create a new branch for your feature:
    git checkout -b feature-name
  3. Make your changes and commit them:
    git commit -m "Description of changes"
  4. Push your changes to your fork:
    git push origin feature-name
  5. Submit a pull request to the main repository.

📜 License

This project is licensed under the MIT License. See the LICENSE file for more details.


📞 Contact

For any questions, suggestions, or feedback, feel free to reach out:

Happy Coding! 🎉

About

AlgoSort Sorting Visualizer is an interactive web application that visually demonstrates various sorting algorithms, such as Bubble Sort, Merge Sort, Quick Sort, and more. It allows users to adjust array size and sorting speed, offering an engaging way to understand and compare the performance of sorting techniques through animations.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published