Question: What does the following algorithm compute? procedure who knows(a, az, . ..., a,,: integers) m:= 0 for i:=1 to n-1 for j := i
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.
Step by Step Solution
3.58 Rating (159 Votes )
There are 3 Steps involved in it
SOLUTION Lets break down the algorithm step by step 1 m 0 This line initializes a variable m to 0 2 ... View full answer
Get step-by-step solutions from verified subject matter experts
