fn insertion_sort(to_sort: &mut [isize]) {
    for i in 0..to_sort.len() {
        let mut i_min: usize = i;
        let tempo: isize;
        for c in i+1..to_sort.len() {
            if to_sort[c] < to_sort[i_min] {
                i_min = c;
            }
        }
        tempo = to_sort[i];
        to_sort[i] = to_sort[i_min];
        to_sort[i_min] = tempo;
    }
}
/// Slow sort (insertion sort)
Slow sort (insertion sort)
Slow sort ( insertion sort )
fn insertion_sort(to_sort: &mut [isize]) {
    for i in 0..to_sort.len() {
        let mut i_min: usize = i;
        let tempo: isize;
        for c in i+1..to_sort.len() {
            if to_sort[c] < to_sort[i_min] {
                i_min = c;
            }
        }
        tempo = to_sort[i];
        to_sort[i] = to_sort[i_min];
        to_sort[i_min] = tempo;
    }
}
fn insertion_sort ( to_sort : & mut [ isize ] ) { for i in 0 .. to_sort . len ( ) { let mut i_min : usize = i ; let tempo : isize ; for c in i + 1 .. to_sort . len ( ) { if to_sort [ c ] < to_sort [ i_min ] { i_min = c ; } } tempo = to_sort [ i ] ; to_sort [ i ] = to_sort [ i_min ] ; to_sort [ i_min ] = tempo ; } }
Slow sort (insertion sort)
Slow sort ( insertion sort )
to_sort
&mut [isize]
to_sort
&mut [isize]