#sort #sorting #library #benchmark

sorts

A collection of sorting algorithms

6 releases (breaking)

0.6.0 Dec 4, 2018
0.5.0 Dec 1, 2018
0.4.0 Dec 1, 2018
0.3.0 Nov 30, 2018
0.1.0 Nov 30, 2018

#212 in Algorithms

Download history 43/week @ 2018-11-27 32/week @ 2018-12-04 6/week @ 2018-12-11 56/week @ 2018-12-18 1/week @ 2018-12-25 6/week @ 2019-01-01 10/week @ 2019-01-08 14/week @ 2019-01-15 1/week @ 2019-01-22

59 downloads per month

MIT license

76KB
222 lines

Sorts

Crates.io Crates.io Crates.io

A small sorting algorithms collection written in Rust for learning purposes.

Algorithms

Below is a list of all implemented sorting algorithms. Algorithms that are not yet crossed are on the to-do list.

  • Bubble sort
  • Merge sort
  • Insertion sort
  • Selection sort
  • Cocktail sort
  • Gnome sort
  • Heapsort
  • Comb sort
  • Quicksort
  • Bucket sort
  • Radix sort
  • Shellsort
  • Bogosort
  • Stooge sort

Benchmarking

The benchmark code is located in the benches directory. It can be run using

$ cargo bench

The results are outputted to target/criterion. The benchmark tests the different sorting algorithms against different problem sizes.

sorting algorithms running times


lib.rs:

Rust sort collection

This is the documentation for sorts. This crate contains a collection of various sorting algorithms.

No runtime deps