# Find the Minimum Absolute Difference Implement `minimum_absolute_difference(values)`. Given at least two integers, return the smallest absolute difference between any two distinct positions in the list. Duplicate values are allowed, in which case the answer is zero. Do not mutate the caller's list. ## Constraints - `2 <= len(values) <= 200000` - `-10^18 <= values[i] <= 10^18` ## Examples - `[1, 20, 100, 3]` returns `2`. - `[8, -1, 8]` returns `0`. ## Clarifications Explain why, after an appropriate ordering, the closest pair must be adjacent. Include time and auxiliary-space complexity. ## Hints Ordering the values removes the need to compare every pair. ## Extensions - Return every pair attaining the minimum. - Maintain the answer under online insertions. - Generalize to points in two dimensions.