Genius sorting algorithm: Sleep sort

Man, am I a genius. Check out this sorting algorithm I just invented.


#!/bin/bash
function f() {
    sleep "$1"
    echo "$1"
}
while [ -n "$1" ]
do
    f "$1" &
    shift
done
wait

example usage:
./sleepsort.bash 5 3 6 3 6 3 1 4 7

>>21,23-24
For optimal results, use a logistic function^{eg. 0.5+9.5/((1+0.5e^(-1.5(t-10)))^(2))} to normalize the inputs. You can bound the sleep time arbitrarily this way. I'm not writing that in bash.