Start by considering the brute-force approach: compare every pair of numbers to find the minimum difference. What is the time complexity of this approach?

To optimize, think about sorting the array first. How does sorting help in reducing the number of comparisons needed to find the minimum gap?

After sorting, realize that the minimum gap must occur between two adjacent elements in the sorted array. How can you efficiently traverse the sorted array to find this minimum adjacent difference?