Switching from it to an in-place algorithm at a sufficiently deep level of recursion results in a logarithmic worst case runtime in an algorithm developed by David Musser.
Doug McIlroy described a way to find the worst inputs for this algorithm in "A Killer Adversary for" it. Switching from it to an in-place algorithm at a sufficiently deep level of recursion results in a logarithmic worst case runtime in an algorithm developed by David Musser. The complexity of this algorithm increases as its workload decreases, which is why running it on an ordered list has complexity O(n^2) ["big oh of en squared"] even though its average runtime is O(n log n) ["big oh of en log en"]. First developed by (*) C. A. R. Hoare, its second step partitions elements of a list which are greater and smaller than a pivot. For ten points, name this algorithm, the fastest sorting algorithm known.
Doug McIlroy described a way to find the worst inputs for this algorithm in "A Killer Adversary for" it.
quicksort (prompt on sorting algorithm) &lt;HX&gt;