• We use quick select to find the kth smallest/largest item
  • Quickselect, like it’s name might imply, is related to Quick Sort.
  • We can use the quick sort method to partition and sort data
  • After sorting a partition we only need to evaluate, the remaining block that will contain are target, thus saving time over a full sort
  • Once the kth item is used as a partition, we know it’s in it’s final sorted location and can return it.

Practice Problems