Describe your change:

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Description:

Fixes #1867

This PR addresses the mathematical bias and off-by-one errors in the shuffle function inside the bogoSort implementation.

1. Corrected the loop bounds so that the last element of the array is no longer skipped during the shuffle process.
2. Updated the random index generation range from [0, i) to [0, i] by using Math.random() * (i + 1). This ensures an unbiased Fisher-Yates shuffle where elements are allowed to swap with themselves, restoring proper uniform distribution.
3. Updated the code to use clean, modern ES6 array destructuring for the variable swapping logic.

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new JavaScript files are placed inside an existing directory.
• All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames. Example: UserProfile.js is allowed but userprofile.js, UserProfile.js , user-Profile.js, user_profile.js are not
• All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.