Skip to content

shashank-navale/Sorting-Algorithms-Visualizer

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Sorting-Algorithms-Visualizer

This project is a Python application that visualizes different sorting algorithms using Pygame. It is great for students, developers, and educators who want to learn how sorting algorithms work through animation.
Support this project by leaving a ⭐

Bubble sort Bucket sort Cocktail sort
Counting sort Heap sort Insertion sort
Merge sort Quick sort Selection sort

How to run

  • Clone GitHub repository git clone https://github.com/LucasPilla/Sorting-Algorithms-Visualizer.git
  • Install requirements: pip3 install -r requirements.txt
  • Run: python3 src/main.py

How to use

  1. Enter appropriate number of bars required in the text box
  2. Pick appropriate sorting algorithm from the dropdown for the visualizer
  3. Use the play/pause button to control the visuals

Supported Algorithms - Average Time Complexities

  • Cycle Sort - O(n^2)
  • Cocktail Sort - O(n^2)
  • Counting Sort - O(n + k)
  • Quick Sort - O( n log n)
  • Merge Sort - O(n log n)
  • Selection Sort - O(n^2)
  • Bubble Sort - O(n^2)
  • Insertion Sort - O(n^2)
  • Bogo Sort - O((n-1)!)
  • Heap Sort - O(n log n)
  • Shell Sort - O(n log n)
  • Radix Sort - O(nk)
  • Bucket Sort - (n + k)
  • Pancake Sort - O(n^2)

Licensing

  • This project is licensed under the MIT License

About

Program made with Python and Pygame module for visualizing sorting algorithms

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%