René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Potential bug in left recursive call of QuickSort","articleBody":"Hello Sir,\n\nI was studying the sorting algorithms from this repository and testing out the code on a few different arrays. I noticed that the `QuickSort` implementation sometimes fails to sort correctly or throws a `StackOverflowError` on larger, unsorted arrays.\n\nWhile tracing the execution in **`4 Other Problems/QuickSort.java`**, I believe I found the root cause in the `quickSort` method:\n\n```java\nint partitionIndex = partition(nums, low, high);\nquickSort(nums, 0, partitionIndex - 1); // \u003c-- Left recursive call\nquickSort(nums, partitionIndex + 1, high);\n```\n\nBecause the left recursive call uses a hardcoded 0 instead of the low variable, it attempts to sort from the absolute beginning of the array every time, rather than the beginning of the current sub-problem. This seems to overwrite already sorted sections.\n\nChanging that 0 to low appears to resolve the issue perfectly during my local testing.\n\nThank you for sharing all these resources, they have been really helpful for my DSA practice!","author":{"url":"https://github.com/UsaaryanByte07","@type":"Person","name":"UsaaryanByte07"},"datePublished":"2026-06-14T19:05:40.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":1},"url":"https://github.com/1/DSA_using_Java/issues/1"}