A naive implementation of a strange sorting algorithm

sleep_sort.rs

//https://twitter.com/fermatslibrary/status/937687947041701888
use std::{thread, time};
use std::sync::{Arc, Barrier};

fn main() {
    let elements = vec![9,8,7,6,5,4,3,2,1,0];
    sleep_sort(elements);
}

fn sleep_sort(dataset: Vec<i32>) {
    let barrier = Arc::new(Barrier::new(dataset.len()));
    let mut handles: Vec<std::thread::JoinHandle<()>> = Vec::with_capacity(dataset.len());

    for element in dataset {
        let barrier = barrier.clone();
        handles.push(thread::spawn(move ||{
            barrier.wait();
            thread::sleep(time::Duration::from_millis(element as u64));
            println!("{}", element);
        }));
    }

    for handle in handles {
        handle.join().unwrap();
    }
}