Quick Select

Introduction

The quick select algorithm is used to locate the element in an array that will be at the $k^{th}$ place when the array has been sorted. At each phase of the algorithm, we ignore the first half of the array and concentrate on the part where the $k^{th}$ element is located.

Code example

Let’s implement the algorithm.