Skip to content

README.md

Latest commit

 

History

History
61 lines (47 loc) · 1.43 KB

README.md

File metadata and controls

61 lines (47 loc) · 1.43 KB

Sorting Algorithm Visualizer 🎨

Sorting Algorithm Visualizer is a Python project built with Pygame to visualize how different sorting algorithms work step by step. It supports Bubble, Insertion, Selection, Merge, Quick, Heap, and Radix Sort, with options for ascending/descending order, adjustable speed, and reset.
A simple and beginner-friendly way to learn sorting.

Features

  • Bubble Sort
  • Insertion Sort
  • Selection Sort
  • Merge Sort
  • Quick Sort
  • Heap Sort
  • Radix Sort
  • Ascending/Descending option
  • Adjustable speed

Controls

  • R → Reset list
  • SPACE → Start Sorting
  • A → Sort Ascending
  • D → Sort Descending
  • B → Bubble Sort
  • I → Insertion Sort
  • S → Selection Sort
  • M → Merge Sort
  • Q → Quick Sort
  • H → Heap Sort
  • X → Radix Sort
  • ↑ → Increase speed
  • ↓ → Decrease speed

How to Run

git clone https://github.com/SHASHANKBHATT03/Sorting-Algorithm-Visualizer.git
cd Sorting-Algorithm-Visualizer
pip install -r requirements.txt
python Sorting_Visualizer.py

File Structure

Sorting-Algorithm-Visualizer/ -├── Sorting_Visualizer.py # Main visualizer script -├── requirements.txt # Project dependencies -└── README.md # Project documentation

Demo Video

Sorting.Visualiser_demo.mp4