sorting 1.2.0

The world's best, finest and inefficient sorting algorithms.
Documentation
  • Coverage
  • 100%
    19 out of 19 items documented1 out of 1 items with examples
  • Size
  • Source code size: 35.14 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 3.2 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 17s Average build duration of successful builds.
  • all releases: 17s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Homepage
  • Feliix42/sorting-rs
    16 3 1
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • Feliix42

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

Build Status docs.rs Crates.io

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:

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.