Quick Select algorithm in C++
Closed this issue · 2 comments
chirayu-joshi commented
I would like to add an algorithm to find K-th smallest element in an array. It can be found using various techniques, but quick select is efficient.
Can I send pull request to add this algorithm? I have read CONTRIBUTING.md file.
Thank you.
aniketsharma00411 commented
Ok
chirayu-joshi commented
I have successfully added the algorithm and tested corner cases. I have also sent pull request. Please consider to review it, and if any changes are required, than please inform me.
I am closing this issue, but if needed, you can reopen it.