https://github.com/umarlypoeta/bubble_sort_visualisation
A simple visual representation of the Bubble Sort algorithm using SFML in C++.
https://github.com/umarlypoeta/bubble_sort_visualisation
cpp sfml visualization
Last synced: about 1 year ago
JSON representation
A simple visual representation of the Bubble Sort algorithm using SFML in C++.
- Host: GitHub
- URL: https://github.com/umarlypoeta/bubble_sort_visualisation
- Owner: UmarlyPoeta
- Created: 2024-12-07T23:48:21.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-12-08T22:45:23.000Z (over 1 year ago)
- Last Synced: 2025-07-02T07:02:48.220Z (about 1 year ago)
- Topics: cpp, sfml, visualization
- Language: C++
- Homepage:
- Size: 14.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Bubble Sort Visualization
## Introduction
This project visualizes the Bubble Sort algorithm using SFML in C++. It creates a graphical representation of the sorting process, showing the step-by-step progress of the algorithm.
## Features
- Visual representation of the Bubble Sort algorithm.
- Real-time updates to show the sorting process.
- Customizable number of elements and their heights.
## Installation
1. Clone the repository:
```sh
git clone https://github.com/UmarlyPoeta/bubble_sort_visualisation.git
```
2. Navigate to the project directory:
```sh
cd bubble_sort_visualisation
```
3. Install SFML:
- On Ubuntu:
```sh
sudo apt-get install libsfml-dev
```
- On Windows or other systems, follow the [SFML installation guide](https://www.sfml-dev.org/tutorials/2.5/).
4. Compile the project:
```sh
g++ -o bubble_sort_visualisation main.cpp -lsfml-graphics -lsfml-window -lsfml-system
```
or
```sh
zsh run.zsh
```
## Usage
Run the compiled executable:
```sh
./bubble_sort_visualisation
```
A window will open showing the bars representing the elements being sorted using the Bubble Sort algorithm.
## License
This project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.