Give an efficient algorithm to find the closest pair in an arbitrary array Assume A = [a1,a2,a3,...,an] is an integer array and A is not a sorted. Closest pair of A is the two values from A where the absolute value of |ai-aj| is minimum.