fn main(){
    let mut  a = vec![12,34,45,11,33,10,19];
    insertsort(&mut a);

    println!("{:?}",a);
}

fn insertsort(v: &mut [i32]) {
    //TODO early return if len < 2

    for i in 1..v.len(){
        let mut j = i;
        while j>0 && v[j-1] > v[j] {
            v.swap(j, j-1);
            j = j-1;
        }
    }
}