rust 归并排序 迭代

Rust 归并排序 迭代

参考大佬们的写法写了一个rust版。

这个迭代（非递归）妙就妙在它创建啦一个栈来保存左右两个边界，类似模拟了递归的操作。实际上开销肯定是低于递归写法的。

fn merge(v: &mut Vec<i32>,left: usize,middle: usize,right: usize){
    let mut tmp = Vec::new();
    let mut l = left;
    let mut r = middle;
    while l<middle && r<right {
        if v[l]<=v[r]{
            tmp.push(v[l]);
            l+=1;
        }else{
            tmp.push(v[r]);
            r+=1;
        }
    }
    while l<middle {
        tmp.push(v[l]);
        l+=1;
    }
    while r<right {
        tmp.push(v[r]);
        r+=1;
    }
    let mut index = 0;
    for i in left..right{
        v[i]=tmp[index];
        index+=1;
    }
}

fn merge_sort(v: &mut Vec<i32>){
    let length = v.len();
    let mut step = 2;
    let mut index;
    while step<=length {
        index = 0;
        while index+step<=length {
            merge(v,index,index+step/2,index+step);
            index+=step;
        }
        merge(v, index,index+step/2, length);//清理最后剩余的
        step*=2;
    }
    merge(v, 0, step/2, length);
}

fn main() {
    let mut v = vec![3,42,6,1,42,653,23,3,3,3,3,3,3,5,2];
    merge_sort(&mut v);
    println!("{:?}",v);
}