consider a procedure find() which take array of n integers as input and produce pair of elements of array
whose difference is not greater than the difference of any other pair of element of array. which of the
following represent worst case time complexity of find() procedure?
a. O(n)
b. O(log n)
c. O(nlog n)
d. (n^2 log n)