title: Get the k smallest elements of an array using quick sort
body: <p>How would you find the <em>k</em> smallest elements from an unsorted array using quicksort (other than just sorting and taking the <em>k</em> smallest elements)? Would the worst case running time be the same O(n^2)?</p>