Describe or write an algorithm that finds the minimum absolu…
Describe or write an algorithm that finds the minimum absolute difference between any two numbers \(a\) and \(b\) in a given array \(A\). The absolute difference between \(a\) and \(b\) is \(|a-b| = |b-a|\). For example, if \(a = 2\) and \(b = 5\), then \(|a-b| = |2-5| = 3\). The algorithm running time must be \(O(n\,lg\,n)\).