Question

How many comparisons are required to find second minimum from an unsorted array of 64 integers?

Answer 1

Come to think of it, a radix sort still involves looping over the input data, and a loop has to involve a comparison in the termination condition. It needn't be an ordercomparison, though, just an equality comparison. But you're right, the question says nothing about the data types, so a proper answer has to assume opaque data and a comparator function. If the interviewer instead makes the mistake of posing an int special case (or string at a real push), it's 0