Back to the Problem
After sorting, the closest pair is adjacent — scan consecutive differences.
Complexity: O(N log N)