Welcome
The Sorting Algorithms Visualiser is an interactive C++ desktop application that brings sorting algorithms to life through real-time visual representation. Watch as data structures transform before your eyes, with color-coded comparisons highlighting each step of the sorting process.Quick Start
Get the visualiser running on your machine in minutes
Explore Algorithms
Dive into the implementation details of each sorting algorithm
Usage Guide
Learn how to use the interactive interface and controls
Build from Source
Compile and customize the visualiser yourself
Key Features
6 Sorting Algorithms
Visualize Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Bogo Sort, and the humorous Stalin Sort
Real-Time Visualization
Watch algorithms work with color-coded highlighting showing comparisons and swaps
Interactive Controls
Shuffle, reverse, adjust list size, and control sorting speed
Built with SFML
Powered by the Simple and Fast Multimedia Library for smooth graphics
Supported Algorithms
Bubble Sort
Bubble Sort
Classic comparison-based algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they’re in the wrong order.
Insertion Sort
Insertion Sort
Builds the final sorted array one item at a time by inserting each element into its correct position.
Selection Sort
Selection Sort
Divides the list into sorted and unsorted regions, repeatedly selecting the minimum element from the unsorted portion.
Quick Sort
Quick Sort
Efficient divide-and-conquer algorithm that partitions the array around a pivot element.
Bogo Sort
Bogo Sort
Inefficient randomized algorithm that shuffles the array until it happens to be sorted.
Stalin Sort
Stalin Sort
Humorous “algorithm” that removes elements that are out of order, guaranteeing a sorted result.
Get Started
View on GitHub
Explore the source code and contribute to the project