Sorting Algorithm Visualiser

A Sorting Algorithm Visualiser to demonstrate the algorithms of Quicksort, Bitonic sort, Heap sort, Merge sort, Pigeonhole sort, Comb sort, Bubble sort and of course, Bogo sort.

Features

• Interactive graphical representation of sorting algorithms.
• Multiple sorting algorithms included: Quick Sort, Merge Sort, Heap Sort, Bitonic Sort, Comb Sort, Pigeonhole Sort, Bubble Sort, and Bogo Sort.
• Adjustable array size and sorting delay.
• Keyboard shortcuts for starting sorting, changing algorithms, and shuffling bars.
• Informative GUI elements displaying selected algorithm, elapsed time, and more.

sorting.algorithm.visualiser.mp4

Dependencies

• Python 3.x
• Pygame

Getting Started

To use the Sorting Algorithm Visualiser, follow these steps:

1. Head over to the releases page

2. Download the source code of the latest release

3. Install the required dependencies using pip:

pip install pygame numpy

4. Extract the contents of the file and run the main.py script to start the application

OR

1. Clone the repository to your local machine:

git clone https://github.com/vSparkyy/Neural-Network-Visualiser.git

2. Install the required dependencies using pip:

pip install pygame numpy

3. Run the main.py script to start the application:

python main.py

OR

1. Press the green '<> Code' button and download the ZIP file

2. Extract the contents of the ZIP file into one folder

3. Run the main.py script to start the application

Usage

• Adjust the array size and sorting delay using sliders.
• Press "Space" to start sorting with the selected algorithm.
• Press "R" to shuffle the bars.
• Press "C" to change the sorting algorithm.

Credits

• Coded by vSparkyy
• Assets by jarmishan

Contributing

Contributions are welcome! If you find any issues or want to enhance the visualiser, feel free to create pull requests.

License

This project is licensed under the Apache License 2.0 - see the LICENSE file for details.