### Motivation I've been reviewing the Quicksort partition implementation in this repository. Specifically, I'm focusing on the following segment of the code: ```typescript while (i < j) { while (array[++i] < pivot); while (array[--j] > pivot); if (i < j) { [array[i], array[j]] = [array[j], array[i]]; } } ``` In the scenario where the rightmost element is chosen as the pivot, and all other elements are greater than the pivot (e.g., `[6, 5, 4, 3, 2, 1]`), the code handles the out-of-bounds behavior as follows: `array[-1]` is `undefined`. When `undefined` is compared against a number, it is coerced into `NaN`, resulting in `false` for the comparison. While this approach works and is quite clever, I believe it could be beneficial to make the handling of these cases more explicit. This would enhance the readability and maintainability of the code, making it easier for newcomers to understand and for the code to be adapted or modified in the future. I suggest taking a more conventional approach, such as: ```typescript while (array[--j] > pivot) { if (j === left) break; } ``` This change would make the algorithm's logic more straightforward and easier to follow, without relying on special JavaScript behavior. Thank you for considering this request. I'm open to feedback and suggestions on how to further improve the code. ### Examples _No response_ ### Possible workarounds _No response_