<p>"Worstsort" has a complexity of <a href="https://i.stack.imgur.com/iccKN.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/iccKN.png" alt="\Omega((n!^{(f(n))})^2)"></a> where <a href="https://i.stack.imgur.com/aROy2.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/aROy2.png" alt="n!^{(m)} = (...((n!)!)!...)! ="></a> factorial of n iterated m times. The paper by Miguel A. Lerma can be found <a href="http://arxiv.org/pdf/1406.1077v1.pdf" rel="nofollow noreferrer">here</a>.</p>
What is the most inefficient sorting routine?
<p>For an array of integers, what is the least efficient way of sorting the array. The function should make progress in each step (eg no infinity loop). What is the runtime of that algorithm? </p>