Fixed some description

kaitinghh · kaitinghh · commit 9972919be1e9 · 2023-08-09T01:19:27.000+08:00
diff --git a/src/algorithms/sorting/quickSort/lomuto/QuickSort.java b/src/algorithms/sorting/quickSort/lomuto/QuickSort.java
@@ -16,8 +16,7 @@
  * Implementation Invariant:
  * The pivot is in the correct position, with elements to its left being <= it, and elements to its right being > it.
  *
- * We are implementing Lomuto's partition scheme here due to ease of implementation and alignment with CS2040S lecture
- * slides. This is opposed to Hoare's partition scheme, see more at
+ * We are implementing Lomuto's partition scheme here. This is opposed to Hoare's partition scheme, see more at
  * https://www.geeksforgeeks.org/hoares-vs-lomuto-partition-scheme-quicksort/.
  *
  * Complexity Analysis:

Original file line number	Diff line number	Diff line change
`@@ -16,8 +16,7 @@`
`16`	`16`	`* Implementation Invariant:`
`17`	`17`	`* The pivot is in the correct position, with elements to its left being <= it, and elements to its right being > it.`
`18`	`18`	`*`
`19`		`- * We are implementing Lomuto's partition scheme here due to ease of implementation and alignment with CS2040S lecture`
`20`		`- * slides. This is opposed to Hoare's partition scheme, see more at`
	`19`	`+ * We are implementing Lomuto's partition scheme here. This is opposed to Hoare's partition scheme, see more at`
`21`	`20`	`* https://www.geeksforgeeks.org/hoares-vs-lomuto-partition-scheme-quicksort/.`
`22`	`21`	`*`
`23`	`22`	`* Complexity Analysis:`