Merge pull request ericdrowell#81 from raypereda/patch-1

Quicksort worst case runtime is quadratic, O(n^2)
chothia · Mar 28, 2015 · abaee47 · abaee47
2 parents 41e1d33 + 1c34408
commit abaee47
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/Tables.html b/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>