What does the following algorithm compute? procedure who knows(a, az, . ..., a,,: integers) m:= 0...

   

Transcribed Image Text:

What does the following algorithm compute? procedure who knows(a₁, az, . ..., a,,: integers) m:= 0 for i:=1 to n-1 for j := i + 1 to n if |a₁-a₁|>m then m:= = |a -al Find how many comparisons (if statement) are executed for n=2, n=4. Can you generalize to n. What does the following algorithm compute? procedure who knows(a₁, az, . ..., a,,: integers) m:= 0 for i:=1 to n-1 for j := i + 1 to n if |a₁-a₁|>m then m:= = |a -al Find how many comparisons (if statement) are executed for n=2, n=4. Can you generalize to n.

Answer rating: 100% (QA)

SOLUTION Lets break down the algorithm step by step 1 m 0 This line initializes a variable m to 0 2 ... View the full answer