an implementation of quicksort in rustlang

quicksort.rs

fn choose_pivot(left: uint, right: uint) -> uint {
    if left < right+1 {
        std::rand::task_rng().gen_range(left, right+1)
    } else {
        left
    }
}

fn partition(data: &mut[int], left: uint, right: uint) -> uint {
    let pivotIndex: uint = choose_pivot(left, right);
    let pivotValue: int = data[pivotIndex];
    data.swap(pivotIndex, right);

    let mut storeIndex: uint = left;
    for i in range(left, right) {
        if data[i] < pivotValue {
            data.swap(storeIndex, i);
            storeIndex += 1;
        }
    }

    data.swap(storeIndex, right);
    storeIndex
}

fn sort(data: &mut[int], left: uint, right: uint) {
    if left < right && right < data.len() {
        let p: uint = partition(data, left, right);
        sort(data, left, p - 1);
        sort(data, p + 1, right);
    }
}