Quicksort implemented in Rust

qs.rs

use core::fmt::Debug;

fn quick_sort<T: Ord + Clone + Debug>(mut list: Vec<T>) -> Vec<T> {

    if list.len() < 2 {
        return list;
    }

    let pivot = list.pop().unwrap();
    let mut left: Vec<T> = vec![];
    let mut right: Vec<T> = vec![];

    for element in list {
        if element <= pivot {
            left.push(element);
        } else {
            right.push(element);
        }
    }

    let mut out = quick_sort(left);
    out.push(pivot);
    out.append(&mut quick_sort(right));

    return out;
}

fn main() {
    let v = vec![2, 3, 1, 9];
    let v2 = quick_sort(v);
    println!("{:?}", v2);
}