Question: Given an array of ints data , where n = data.length, consider the following algorithm: int sum = 0; numAboveAvg = 0; for (i =

Given an array of ints data, where n = data.length, consider the following algorithm:

int sum = 0; numAboveAvg = 0;

for (i = 0; i < n; i++)

{

sum+=data[i];

}

average=(double) sum/n;

for (j = 0; j < n; j++)

{

if (data[j] > average)

{

numAboveAvg++;

}

}

a) determine the formula for the number of operations

b) write the big-O notation for the number of operations

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!