This repository contains implementations of various sorting algorithms in C++, Rust, and potentially other languages in the future. The goal is to provide a comprehensive collection of sorting algorithms for educational and reference purposes.
Sorting algorithms are fundamental to computer science and software development. They play a crucial role in optimizing data arrangement in a way that makes searching, insertion, and manipulation more efficient. This repository aims to demonstrate a variety of sorting algorithms, allowing developers to learn, compare, and analyze the efficiency of each algorithm.
The following sorting algorithms are currently implemented:
The repository currently provides implementations in:
- C++
- Rust
(Feel free to contribute implementations in other languages.)
-
Clone this repository:
git clone https://github.com/zakissimo/Sorting
-
Choose a programming language and navigate to the corresponding directory.
-
Compile the source code and run the executable:
For C++:
make ./main
For Rust:
cargo build --release cargo run --release
Contributions are welcome! If you'd like to contribute to this repository, please follow these steps:
-
Fork the repository.
-
Create a new branch for your feature or bug fix:
git checkout -b feature/your-feature-name
-
Make your changes and commit them with descriptive commit messages.
-
Push your changes to your fork:
git push origin feature/your-feature-name
-
Create a pull request from your fork's branch to the
mainbranch of this repository.
This project is licensed under the MIT License.