Sleep Sort in Rust

Published on 31 October 2022 (Updated: 08 May 2023)

Welcome to the Sleep Sort in Rust page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

use std::env::args;
use std::process::exit;
use std::str::FromStr;
use std::thread;
use std::time::Duration;
use std::sync::{Arc, Mutex};

fn usage() -> ! {
    println!("Usage: please provide a list of at least two integers to sort in the format \"1, 2, 3, 4, 5\"");

fn parse_int<T: FromStr>(s: &str) -> Result<T, <T as FromStr>::Err> {

fn parse_int_list<T: FromStr>(s: &str) -> Result<Vec<T>, <T as FromStr>::Err> {
        .collect::<Result<Vec<T>, <T as FromStr>::Err>>()

fn sleep_sort(arr: &mut Vec<i32>) {
    // Start sleep threads that sleep for specified time and append that time to result
    let mut threads = vec![];
    let result_mutex = Arc::new(Mutex::new(vec![]));
    for sleep_time in arr.clone() {
        let result_mutex_clone = Arc::clone(&result_mutex);
        let value = sleep_time.clone();
            thread::spawn(move || {
                thread::sleep(Duration::from_secs(value as u64));

    // Wait for threads to finish
    for thread in threads {

    // Store result
    *arr = result_mutex.lock().unwrap().to_vec();

fn main() {
    let mut args = args().skip(1);

    // Convert 1st command-line argument to list of integers
    let mut arr: Vec<i32> = args
        .and_then(|s| parse_int_list(&s).ok())
        .unwrap_or_else(|| usage());

    // Exit if list too small
    if arr.len() < 2 {

    sleep_sort(&mut arr);

Sleep Sort in Rust was written by:

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.