[−][src]Crate sorting_rs
This library contains following sorting algorithms:
| Sorting algorithm | Features and downsides | Worst-case performance O(): comparisons; swaps | Best-case performance O(): comparisons; swaps | Space complexity O() |
|---|---|---|---|---|
| Bubble | bad for sorted or reversed input | n2; n2 | n; 1 | n or 1 |
| Cocktail | little performance improvement over bubble sort | n2 | n | 1 |
| Comb | speeds up when data is nearly sorted | n2 | nlogn | 1 |
| Gnome | simple and slow, works with one item at a time | n2 | n | 1 |
| Heap | independent of data distribution | nlogn | nlogn or n | n or 1 |
| Bottom-up Heap | upgraded version of heapsort with decreased number of comparisons | nlogn | nlogn or n | n or 1 |
| Insertion | simple, but less effective than quicksort, heapsort or merge sort | n2; n2 | n; 1 | n or 1 |
| Merge | independent of data distribution | nlogn | nlogn or n | n |
| Odd-even | presented to be effective on processors with local interconnections | n2 | n | 1 |
| Odd-even (Batcher) | more efficient version of odd-even sort | log2n | log2n | log2n |
| Quick | bad for sorted or reversed input | n2 | n | n or logn |
| Selection | the least number of swaps among all the algorithms | n2; n | n2; 1 | 1 |
| Shell | it is optimization of insertion sort | n2 or nlog2n | nlogn or nlog2n | n |
| Slow | it's slow, who would ever need it? | |||
| Smooth | variant of heapsort, good for nearly sorted data | nlogn | n | n or 1 |
| Stooge | it's a bit faster than slow sort | n2.7095 | n |
Re-exports
pub use self::bubble_sort::bubble_sort; |
pub use self::cocktail_sort::cocktail_sort; |
pub use self::comb_sort::comb_sort; |
pub use self::gnome_sort::gnome_sort; |
pub use self::heap_sort::heap_sort; |
pub use self::heap_sort::heap_bottom_up_sort; |
pub use self::insertion_sort::insertion_sort; |
pub use self::merge_sort::merge_sort; |
pub use self::oddeven_sort::oddeven_sort; |
pub use self::oddeven_sort::oddeven_batcher_sort; |
pub use self::quick_sort::quick_sort; |
pub use self::selection_sort::selection_sort; |
pub use self::shell_sort::shell_sort; |
pub use self::slow_sort::slow_sort; |
pub use self::stooge_sort::stooge_sort; |
Modules
| bubble_sort | |
| cocktail_sort | |
| comb_sort | |
| gnome_sort | |
| heap_sort | |
| insertion_sort | |
| merge_sort | |
| oddeven_sort | |
| quick_sort | |
| selection_sort | |
| shell_sort | |
| slow_sort | |
| stooge_sort |