Codeless question: Given a set of n numbers, how do you find the pair of numbers that have the smallest difference between them? — Sort them: Once the numbers are sorted, the closest pair of numbers must lie next to each other somewhere in sorted order. Thus, a linear-time scan through them completes the job, for a total of O(n log n) time including the sorting.