Sorting-Visualizer

Overview

The Dynamic Sorting Visualizer is a web-based application that provides a visual representation of various sorting algorithms in action. This project is designed to help users understand how different sorting algorithms work and observe their real-time performance on a dynamic set of data. Additionally, it includes separate web pages for analyzing the Space and Time complexity of these sorting algorithms.

Features

• Visual representation of popular sorting algorithms such as Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and more.
• Dynamic visualization that allows users to interactively see the sorting process on randomly generated data sets.
• Adjustable speed controls for visualizing sorting algorithms at different speeds.
• Separate web pages for analyzing the Space and Time complexity of sorting algorithms.
• User-friendly interface for an intuitive experience.

Installation

1. Clone the repository to your local machine:

   git clone https://github.com/Janhavi0528/Sorting-Visualizer.git

2. Open the project folder:

   cd Sorting-Visualizer

3. Open the Welcome.html file in your web browser.

Usage

-On choosing Sorting Visualizer:

1. Open the application in your web browser.
2. Enter array in "Enter Array" text box to create a new set of data.
3. Click the "Display as bars" to display new set of data.
4. Click the "Start Sorting" button to start the visualization of the selected algorithm.
5. Select a sorting algorithm from the below.
6. Adjust the speed slider to control the visualization speed.

-On choosing Complexity of Algorithm: Explore the space complexity analysis of sorting algorithms.

Contact

For any questions or feedback, feel free to reach out to [janhavivikrantjagtap@gmail.com].

Happy Sorting!