Function rust_sort::insertion_sort::sort

pub fn sort<T: Sortable>(list: &mut [T])

Insertion sorts in-place, stable, in ascending order, a mutable ref slice of type T: Sortable

Insertion sort loops over an unsorted collection one element at a time to build a sorted collection starting as a single element at the beginning. At each loop iteration, the current element is put in its right order within the beginning of the collection, by pushing elements greater than itself to the right. The sorted portion of the collection grows until there are no unsorted items left.

Examples

use rust_sort::insertion_sort::sort;

let mut arr = [3, 2, 1, 7, 9, 4, 1, 2];
sort(&mut arr);
assert_eq!(arr, [1, 1, 2, 2, 3, 4, 7, 9]);