1. The following function sums each element in the list: int listSum (int list[], int size)...

Transcribed Image Text:

1. The following function sums each element in the list: int listSum (int list[], int size) { int sum = 0; for (int index = 0; index < size; index++) sum sum + list[index]; return sum; } a. Find the number of operations executed by the function if the value of size is 10. b. Find the number of operations executed by the function if the value of size is n. c. What is the order of the function (asymptotic notation)? 1. The following function sums each element in the list: int listSum (int list[], int size) { int sum = 0; for (int index = 0; index < size; index++) sum sum + list[index]; return sum; } a. Find the number of operations executed by the function if the value of size is 10. b. Find the number of operations executed by the function if the value of size is n. c. What is the order of the function (asymptotic notation)?

Answer rating: 100% (QA)

a If the value of size is 10 the function will execut... View the full answer