https://en.wikipedia.org/wiki/Quickselect

From the Wikipedia page cited:

  As with quicksort, quickselect is generally implemented as 
  an in-place algorithm, and beyond selecting the kth 
  element, it also partially sorts the data.

  Only the median (or pair around the median) needs to be 
  sorted, the other numbers can be unsorted