René's URL Explorer Experiment

Title: fix(QuickSort): use low instead of hardcoded 0 in left recursive call by omprashantjain · Pull Request #2 · Complete-Coding/DSA_using_Java · GitHub

Open Graph Title: fix(QuickSort): use low instead of hardcoded 0 in left recursive call by omprashantjain · Pull Request #2 · Complete-Coding/DSA_using_Java

X Title: fix(QuickSort): use low instead of hardcoded 0 in left recursive call by omprashantjain · Pull Request #2 · Complete-Coding/DSA_using_Java

Description: Fixes #1 The left recursive call in quickSort used a hardcoded 0 as the lower bound instead of low: quickSort(nums, 0, partitionIndex - 1); // before quickSort(nums, low, partitionIndex - 1); // after Every left-partition call re-sorted the array from index 0 rather than from the start of the current sub-problem. The output stayed correct (the [0, low-1] prefix is already in place), but recursion work blew up to O(n²). On a descending array of 2000 elements the buggy version makes 1,001,001 quickSort invocations vs 3,999 after the fix — which is what can drive the reported StackOverflowError on large inputs. Validated by compiling and running the sort on several arrays (including descending and a 2000-element descending case); all sort correctly, and recursion depth is back to expected. Thanks to @UsaaryanByte07 for the clear report and root-cause trace.

Open Graph Description: Fixes #1 The left recursive call in quickSort used a hardcoded 0 as the lower bound instead of low: quickSort(nums, 0, partitionIndex - 1); // before quickSort(nums, low, partitionIndex - 1); // ...

X Description: Fixes #1 The left recursive call in quickSort used a hardcoded 0 as the lower bound instead of low: quickSort(nums, 0, partitionIndex - 1); // before quickSort(nums, low, partitionIndex - 1); // ...

Opengraph URL: https://github.com/Complete-Coding/DSA_using_Java/pull/2

X: @github

direct link

Domain: github.com

Links:

Viewport: width=device-width