Tag Archives: quicksort

Find Kth minimum element in a unsorted array

Some days ago while interviewing a candidate, I asked the candidate a very easy by the book interview question. Design an efficient algorithm to find the 2nd smallest integer in a unsorted integer array of length N, which should run … Continue reading

Posted in Algorithm | Tagged , , , , , , | 4 Comments