3 releases
0.1.2 | Oct 15, 2023 |
---|---|
0.1.1 | Aug 4, 2023 |
0.1.0 | Aug 4, 2023 |
#762 in Algorithms
16KB
136 lines
AtrociousSort
This project's purpose is to provide Rust with blazingly fast (not guaranteed) implementations of some of the most useless sorting algorithms out there.
List of planned algorithms
- Slow Sort
- Bogo Sort
- Bozo Sort
- Bogobogo Sort
- Quantum Bogo Sort
- Schrodinger's Sort
- Tableflip Sort (╯°□°)╯︵ ┻━┻
- Stooge Sort
List of implemented algorithms
- Stalinsort
- Inteligent Design Sort
- Sleep Sort
All algorithms contain one or more of the following features
- has a horrible runtime
- messes up your array in such a way that you wish you sorted it manually
- might not actually sort an array according to your expectations
Motivation
Essentially, I saw a video on YouTube talking about "unconventional" (completely bonkers) sorting algorithms and wanted to implement some of them that I found interesting. I thought while I was at it I might as well lean fully into the absurdity and implement a resonably performing version of the totally useless algorithms.
Usage
Warning: If you intend to use this crate in any serious manner or productive environment you should have your programming privileges revoked.
Performance
If one of the implemented algorithms happens to have a good performance, you'll pay for it another way.
Limitations
See everything above.