Question

17. Consider the following algorithm: procedure Algorithm(n: positive integer; di,d2.. ,dn: distinct integers) for 1 to n-1 for 1 to n-k if ddi+ then interchange di and di+ print(k, I, d,ddn-1, dn) (a) |3 points Assume that this algorithm receives as input the integer-6 and the corresponding input sequence 41 36 27 31 17 20 Fill out the table below ds (b) 1 point Assume that the algorithm receives the same input values as in part a). Once the algo- rithm finishes, what is the order of the elements d? 2 345 6 Answer: (c) point] Assume that the algorithm receives the same input values as in part a). Once the algo- rithm finishes, what is the total number of comparisons that the algorithm will have performed? total number of comparisons Similar as it was discussed in footnote 4, make sure to not foeget to coust the comparisons that arise from the two different Toe" loops, namely kr the counter variables k and l; at cach repetition, the algorithan must check whether k < n-1 and whether I Sn-k

Answer 1

5 6 2 3452 3 4 12 312 3C 36 3 4 47 30 24 27 27 411 1271 27 31 31 31 3 3 171许 17 20 d6 201 |20| 20 di 627 2 17 20