# Interview preparation kit, Greedy Algorithm

## Minimum absolute difference in array

• Thought: No need to brute force, since it emphasizes on the abs diff b/w two numbers, then we can easily sort the whole array, and the diff b/w two consecutive elements will be the minimum.
• Thought:
• Time complexity: O(NlogN), due to quick sort (std::sort)
• Space complexity: O(N), due to quick sort (std::sort)
int minimumAbsoluteDifference(vector<int> arr)
{
int res = INT_MAX, n = arr.size();
sort(arr.begin(), arr.end());
for(int i = 0; i < n - 1; i++)
{
res = min(res, (arr[i + 1] - arr[i]));
if(res == 0) // zero will be the smallest possible value, just return the answer immediately
{
return res;
}
}
return res;
}