This is from a common coding interview question: Imagine you are given a

list of n integers. Assume they are distinct if that helps you. Give an algorithm

that finds the smallest and the second smallest element in the list, using at most

n $+$ log n comparisons, and explain why your algorithm needs at most n $+$ log n

comparisons.