Algo_ds_101: Algorithm - QuickSelect - Kth Largest Element in an Array

[abhishekpopli]

Submission Title
QuickSelect Algorithm

Submission Type
Algorithm

Submission Description
Quickselect is a selection algorithm to find the k-th smallest element in an unordered list
The algorithm is similar to QuickSort. The difference is, instead of recurring for both sides (after finding pivot), it recurs only for the part that contains the k-th smallest element.

Folder Related To
Repo =>Algorithms => Sorting_Algorithms => Quick_Select

Contributors
abhishekpopli

• [x] C++ -
• [x] C -
• [x] Python -
• [ ] Java -
• [x] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [ ] php -
• [ ] Swift -
• [ ] C# -

[github-actions[bot]]

👋 @abhishekpopli

Thanks for opening your first issue here! Be sure to follow the issue template!

[abhishekpopli]

Kindly assign it to me.

[ArchanaDhaker]

I want to add this algo in python. kindly assign to me.

[Avninder99]

I would like to do this algorithm in JavaScript. Please assign it to me.

[subham5230]

I can do this in Java please assign it to me @ahampriyanshu

[Avninder99]

Please assign me this algorithm to me for C too.

[Astrogeek77]

@ahampriyanshu Can you assign this task to me in c?

[ahampriyanshu]

Hi @Avninder99 :wave: go ahead with JS
Hi @Astrogeek77 :wave: go ahead with C

[krabhisharma]

@ahampriyanshu assign me this for java

[ayush-670]

Can I do this in java?

[ayush-670]

I could do it with Ruby too, can you assign it to me in either of the two?

[reyadkhan]

Hi, I would like to do it in PHP. Would you like to assign me plz?

[ahampriyanshu]

thanks everyone :v: