Q1 double sumskip10 double array int n n size of the array A
Q1.
double sum_skip10 (double array[], int n)
//n: size of the array. Assume n is divisible by 10
{
double sum=0;
for (int i=0; i<n; i=i+10)
sum = sum + array[ i ];
return sum;
Please use the table provided
Solution
//n: size of the array. Assume n is divisible by 10
double sum_skip10 (double array[], int n)
{
1. double sum=0;
2. for (int i=0; i<n; i=i+10)
3. sum = sum + array[ i ];
4. return sum;
}
line time taken to run this line total number of times needed to execute
1 1 : constant 1
2 n/10 n/10
3. 1 : constant n/10
4. 1: constant 1
Total time: 1 + n/10 + 1 + 1 = O(n)
![Q1. double sum_skip10 (double array[], int n) //n: size of the array. Assume n is divisible by 10 { double sum=0; for (int i=0; i<n; i=i+10) sum = sum + arra Q1. double sum_skip10 (double array[], int n) //n: size of the array. Assume n is divisible by 10 { double sum=0; for (int i=0; i<n; i=i+10) sum = sum + arra](/WebImages/17/q1-double-sumskip10-double-array-int-n-n-size-of-the-array-a-1031498-1761534646-0.webp)