Quicksort worst case runtime is quadratic, O(n^2)

Doug McIlroy's 1999 paper “A Killer Adversary for Quicksort” describes how to find inputs to the sort that display this quadratic behavior.
http://www.cs.dartmouth.edu/~doug/mdmspe.pdf
Here's a discussion on the topic by Russ Cox at http://research.swtch.com/qsort

Tables.html

@@ -194,7 +194,7 @@ <h2 id="sorting">Array Sorting Algorithms</h2>
       <td><a href="http://en.wikipedia.org/wiki/Quicksort">Quicksort</a></td>
       <td><code class="orange">O(n log(n))</code></td>
       <td><code class="orange">O(n log(n))</code></td>
-      <td><code class="orange">O(n log(n))</code></td>
+      <td><code class="red">O(n^2)</code></td>
       <td><code class="yellow-green">O(log(n))</code></td>
     </tr>
     <tr>