Sorting-Visualizer

Sorting Visualizer a GUI based python program to visualize common Sorting Algorithms.
Explore the docs »

View Code · Report Bug · Pull Request

Table of Contents

1. About The Project
   • Built With
2. Getting Started
   • Prerequisites
   • Installation
3. Roadmap
4. Contributing
5. License
6. Contact
7. Acknowledgements

About The Project

This project is about visualizing sorting algorithms like Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Shell Sort, Radix Sort, Cocktail Sort, Gnome Sort, Heap Sort, Bucket Sort, Bitonic Sort, Tim Sort, Comp sort as well as Bogo Sort. We can select any sorting algorithm and visualize how they sort it. We can also change the array size, minimum and maximum number in an array.

Built With

• Python

Modules used

• tkinter
• random
• package - (custom)

Getting Started

Prerequisites

Make sour app have the latest version of python & pip installed.

• pip

  -m pip install –upgrade pip.

Installation

1. Clone the repo

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

2. Running the app

   cd app
   python main.py

Roadmap

See the network for a list of proposed features from Contributes.

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Instagram : udyawarkarthik

Github : https://github.com/KarthikUdyawar

Acknowledgements

• GeeksforGeeks