feat: improve space complexity of QuickSort algorithm

[DevAnuragT]

 know more

Describe your change:

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

Improved the space complexity of the QuickSort algorithm by removing additional arrays (GREATER and LESSER) and implementing in-place partitioning using swapping.

Checklist:

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized.
• [x] I know that pull requests will not be merged if they fail the automated tests.
• [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x] All new JavaScript files are placed inside an existing directory.
• [x] 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,userProfile.js are not
• [x] All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation. Fixes: #1703

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests :white_check_mark:

Project coverage is 84.68%. Comparing base (9010481) to head (40a9414).

Additional details and impacted files

```diff @@ Coverage Diff @@ ## master #1704 +/- ## ========================================== + Coverage 84.65% 84.68% +0.02% ========================================== Files 378 378 Lines 19744 19775 +31 Branches 2951 2952 +1 ========================================== + Hits 16715 16746 +31 Misses 3029 3029 ```

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.