README.md

The world's best and finest sorting algorithms, implemented in Rust

This crate only implements the most useless or inefficient sorting algorithms. You may use them in your production application, altough I would strongly advise against that. Currently, the following sorting algorithms are implemented:

• Slowsort
• Bogosort
• Panicsort
• Sleepsort
• Miraclesort

If you feel like this list misses some fancy algorithm (which it surely does!), you can implement it and open a PR or open an issue. :)

Why occupy such a good crate name for this?!

Honestly, I did not think much of this at the time this was conceived. But if you think you have a more valid use for this crate name, please do get in touch with me so that we can work something out!

Implementation & Usage

All algorithms are currently implemented as traits for any Vec<T> where T fulfills the trait PartialOrd. So in order to use these sorting alrogithms, you can just invoke them on the object of interest:

use sorting::*;

let unsorted = vec![5, 7, 8, 2, 1, 0];
unsorted.panicsort();   // will panic

Using the respective traits you can always implement these methods for your own structures.

License

This work is licensed under the Mozilla Public License 2.0.