/Algorithm-Visualizer

An advanced visualizer for various sorting algorithms. Allows users to input custom arrays, generate random arrays, and visualize different sorting techniques including Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Selection Sort, and Heap Sort.

Primary LanguageHTMLGNU General Public License v3.0GPL-3.0

Algorithm Visualizer

An advanced visualizer for various sorting algorithms. Allows users to input custom arrays, generate random arrays, and visualize different sorting techniques including Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Selection Sort, and Heap Sort.

Features

  • Visualize sorting algorithms step-by-step
  • Input custom arrays or generate random arrays
  • Adjustable array size
  • Real-time iteration count display

Algorithms Supported

  • Bubble Sort
  • Insertion Sort
  • Quick Sort
  • Merge Sort
  • Selection Sort
  • Heap Sort

Getting Started

Prerequisites

  • A modern web browser (Chrome, Firefox, Edge, Safari)

Installation

  1. Clone the repository: 
    git clone https://github.com/alwalid54321/Algorithm-Visualizer.git
  2. Open index.html in your web browser to view the visualizer.

Usage

  1. Set Array: Enter numbers separated by commas and click "Set Array".
  2. Generate Random Array: Enter the desired array size and click "Generate Random Array".
  3. Sorting Algorithms: Click any sorting algorithm button to visualize the sorting process.
  4. Iteration Count: The number of iterations performed during sorting is displayed below the buttons.

Contributing

Contributions are welcome! Please follow these steps to contribute:

  1. Fork the repository.
  2. Create a new branch: 
    git checkout -b feature/your-feature-name
  3. Make your changes and commit them: 
    git commit -m "Add some feature"
  4. Push to the branch: 
    git push origin feature/your-feature-name
  5. Create a pull request.

License

This project is licensed under the GNU General Public License v3.0 - see the LICENSE file for details.

Acknowledgements