Question

Consider the following algorithm segment. Assume that n is a positive integer. max := a[5] for i:= 6 ton if max < a[i] then max := a[i] next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. To find the answer, it may be helpful to review Example 11.3.3 and the solutions to Exercise 11.3.11a and Exercise 11.3.14a. Express your answer in terms of n. The number of operations is 2n – 16 (b) Apply the theorem on polynomial orders to the expression in part (a) to find that an order for the algorithm segment is n'

asked Sep 20, 2024 177k views

Consider the following algorithm segment. Assume that n is a positive integer. max := a[5] for i:= 6 ton if max < a[i] then max := a[i] next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. To find the answer, it may be helpful to review Example 11.3.3 and the solutions to Exercise 11.3.11a and Exercise 11.3.14a. Express your answer in terms of n. The number of operations is 2n – 16 (b) Apply the theorem on polynomial orders to the expression in part (a) to find that an order for the algorithm segment is n'