Suppose we have an unsorted list of rational numbers $($so the numbers can be positive or

negative, and they may have decimals$).$ Give an efficient algorithm that finds the largest

difference between two numbers in such an array when it is written in sorted order. The

algorithm runs in linear time. Note we are finding the largest difference between two

numbers when it is written in sorted order. For example, $0,10,100,$ the largest

difference is $90=100-10,$ not $100-0.$