QuickSelect

It is a selection algorithm to find the k-th smallest element in an unordered list. It is related to the quick sort sorting algorithm.

Complexity

O(n) (with a worst-case of O(n^2))

---

<p align="center"> A massive collaborative effort by <a href="https://github.com/OpenGenus/cosmos">OpenGenus Foundation</a> </p>

---