Question: 2. This algorithm should find the spread (max-min) of a list but it has a problem. Explain. || PRE: A[0 , ... , n-1] is

2. This algorithm should find the spread (max-min) of a list but it has a problem. Explain. || PRE: A[0 , ... , n-1] is a list . spread = -inf for i O to n-2 for j i+1 to n-1 if A[i] A[j] > spread spread = A[i] A[j] end end end POST: spread found
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
