NO CODE ONLY PSEUDO CODE Given an array A with maximum M and

NO CODE

ONLY PSEUDO CODE!

Given an array A with maximum M and minimum m Show that there is a pair of numbers A[i], A [i + 1] so that |A[i] - A[i + 1]| lessthanorequalto (M - m)/(n - 1) Give an algorithm that finds such numbers

Solution

function maximum (Array)
   int length = length of Array
   int i =0,max = Array[0];
  
   for i=0 to length of Array
       if(max < Array[i])
           max = Array[i]
   return max

function manimum (Array)
   int length = length of Array
   int i =0,min = Array[0];
  
   for i=0 to length of Array
       if(min > Array[i])
           main = Array[i]
   return min

n = length of Array
M = maximum(Array)
m = minimum(Array)

for i =0 to lenght of Array
   if(abslute values of (Array[i]-Array[i+1]) <= ((M-m)/(n-1)))
       print Array[i] and Array[i+1]