Edited space complexity

Author: kaitinghh

src/algorithms/sorting/quickSort/hoares/README.md

@@ -38,8 +38,7 @@ especially when the array is already sorted or has a specific pattern. This is b
 might create highly unbalanced sub-arrays, causing the algorithm to degrade to O(n^2) time complexity.
 
 Space:
-- O(logn) as the partitioning is done in-place so each partitioning takes O(1) space but depth of QuickSort recursion 
-  is logn, therefore logn * O(1) = O(logn)
+- O(1) excluding memory allocated to the call stack, since partitioning is done in-place
 
 ## Notes
 

src/algorithms/sorting/quickSort/lomuto/QuickSort.java

@@ -38,8 +38,7 @@
  * duplicates in the array leads to extremely unbalanced partitioning, leading to a O(n^2) time complexity.
  *
  * Space:
- * - O(logn) as the partitioning is done in-place so each partitioning takes O(1) space but depth of QuickSort
- *   recursion is logn, therefore logn * O(1) = O(logn)
+ * - O(1) excluding memory allocated to the call stack, since partitioning is done in-place
  */
 
 public class QuickSort {

src/algorithms/sorting/quickSort/paranoid/QuickSort.java

@@ -29,8 +29,7 @@
  * enter an infinite loop of repeating pivot selection.
  *
  * Space:
- * - O(logn) as the partitioning is done in-place so each partitioning takes O(1) space but depth of QuickSort
- *   recursion is logn, therefore logn * O(1) = O(logn)
+ * - O(1) excluding memory allocated to the call stack, since partitioning is done in-place
  */
 
 public class QuickSort {

src/algorithms/sorting/quickSort/threeWayPartitioning/QuickSort.java

@@ -22,8 +22,7 @@
  * - Best case: O(nlogn)
  *
  * Space:
- * - O(logn) as the partitioning is done in-place so each partitioning takes O(1) space but depth of QuickSort
- *   recursion is logn, therefore logn * O(1) = O(logn)
+ * - O(1) excluding memory allocated to the call stack, since partitioning is done in-place
  */
 
 public class QuickSort {