chore(book-quicksort): update time complexities

Author: amejiarosario

book/content/part04/sorting-algorithms.asc

@@ -135,8 +135,7 @@ We explored many algorithms some of them simple and other more performant. Also,
 | <<part04-algorithmic-toolbox#insertion-sort>> | O(n^2^)    | O(n) | O(n^2^) | O(1)      | Yes    | Yes      | Yes    | Yes
 | <<part04-algorithmic-toolbox#selection-sort>> | O(n^2^)    | O(n^2^) | O(n^2^) | O(1)        | No     | Yes      | No    | No
 | <<part04-algorithmic-toolbox#merge-sort>>     | O(n log n) | O(n log n) | O(n log n) | O(n)        | Yes     | No       | No     | No
-| <<part04-algorithmic-toolbox#quicksort>>      | O(n log n) | O(n^2^) | O(n log n) | O(log n)    | Yes     | Yes      | No     | No
+| <<part04-algorithmic-toolbox#quicksort>>      | O(n log n) | O(n log n) | O(n^2^) | O(log n)    | No     | Yes      | No     | No
 // | Tim sort       | O(n log n) | O(log n)    | Yes    | No       | No     | Yes
 |===
 // end::table[]
-