This reminds me of my favorite joke algorithm, sleepsort[0]. A trivial implementation looks like this:

    #!/bin/bash
    for int in $@; do  # input must be a list of positive integers
        (sleep $int; echo $int) &
    done; wait

I'm not quite sure how to describe it in terms of big O notation.

[0] https://rosettacode.org/wiki/Sorting_algorithms/Sleep_sort