quick sort

qsort.rs

fn quicksort<T: Ord>(mut lst: Vec<T>) -> Vec<T> {
    if let Some(pivot) = lst.pop() {
        let (less, more): (Vec<_>, Vec<_>) = lst.into_iter().partition(|x| x < &pivot);
        let mut res = quicksort(less);
        res.push(pivot);
        res.extend(quicksort(more));
        return res;
    } else {
        vec![]
    }
}

fn main() {
    let lst = vec![3, 1, 5, 9, 2, 8, 4, 2, 0, 3, 12, 4, 9, 0, 11];
    println!("{:?}", lst);
    println!("{:?}", quicksort(lst));
}