What is the fastest algorithm to find the minimum difference between pairs of numbers in an array?
What is the minimum number of comparisons required to find the pair of integers, in an array of n unsorted integers, whose absolute difference is the smallest?