4. Suppose you have an array of 100 numbers. You are intersted in finding the kth smalest number. For instance you want the 27th smallest number. At first you think that the best way to find this number is to sort the data and index into the array at the 27th location. Clearly the complexity of this would be the complexity to sort the data, typically nlnn for Quicksort for instance. But then you
OR
OR