Question

Consider the following algorithm: ocedure Algorithm (b: integer, n: positive integer,i datinct integem) proc answer :", 0 nand 6 while (j print(j, z, b, answer) if jSn then answer:-j return answer (8 points] Assume that this algorithm receives as input the numbers b-17 andn9nd the corresponding sequence or iaie i 2 3 4 516 7 8 corresponding sequence of integers 19 Fill out the table below: i 는, ↓answer (b) [I point] Assume that the algorithm receives the same input valuwes as in part a), Once the algo rithm finishes, it returns as output the value of the variable answer. What is its value? answer (e) [1 point] Assume that the algorithm receives the same input values as in part a). Oace the algo rithm finishes, what is the total number of comparisons that the algorithm will have performed? total number of comparisons whenever it checks the alidity rmed in section 3.3 of our textbook, we say that an

Answer 1

a) the below output is as per print statement in the algorithm

j z b answer
2 28 17 0
3 35 17 0
4 23 17 0
5 41 17 0

b) answer = 17

Reason: when j=5, then while condition becomes false as b is equals to z that is 17.
   then it exits the while loop and jumps to if condition.
   then if condition becomes true that is 5 is less than 9. So answer = 5

c) total number of comparisons = 4+1 = 5 as 4 comparisons in while loop and one final comparison in if condition.