title: What is the time complexity of the sleep sort?
body: <p>Given this sort algorithm how do you express its time complexity?</p>
  
  <p><strike><a href="http://dis.4chan.org/read/prog/1295544154" rel="noreferrer">Originally presented here</a></strike> <a href="https://web.archive.org/web/20151231221001/http://bl0ckeduser.github.io/sleepsort/sleep_sort_trimmed.html" rel="noreferrer">(partial archive)</a>.</p>
  
  <pre><code>#!/bin/bash
  function f() {
  sleep "$1"
  echo "$1"
  }
  while [ -n "$1" ]
  do
      f "$1" &amp;
      shift
  done
  wait
  
  example usage:
  ./sleepsort.bash 5 3 6 3 6 3 1 4 7
  </code></pre>