Min Absolute Sum

Given an integer array, find two elements whose absolute sum has the minimum value. The elements cannot be the same element in the array. Test with various test cases. Specify input format and output requirements clearly. Example Input [-10, -3, 4, 7, 8]