For each of the following pieces of code, count the number of steps, and express an...

 

Transcribed Image Text:

For each of the following pieces of code, count the number of steps, and express an upper bound in the Big-Oh notation. (a) //A is an integer array of size n for (int i-1; i<n; i++){ int j =i-1; while(j>0){ aj } A[i]+=A[j12 j--; 1 int sum=0; for (int i=1; i<n; i*=2) { for (int j-n; j>0; j/=2){ for (int k-j; k<n; k+=2){ sum+i+ j * k; } } (b) //A is an integer array of size n for (int i=0; i<n; i++){ while (A[i]==0) { count++; i++; } for (int i-1; i<n; i*=5) A[i]=count; Activate Windows Go to Settings to activate For each of the following pieces of code, count the number of steps, and express an upper bound in the Big-Oh notation. (a) //A is an integer array of size n for (int i-1; i<n; i++){ int j =i-1; while(j>0){ aj } A[i]+=A[j12 j--; 1 int sum=0; for (int i=1; i<n; i*=2) { for (int j-n; j>0; j/=2){ for (int k-j; k<n; k+=2){ sum+i+ j * k; } } (b) //A is an integer array of size n for (int i=0; i<n; i++){ while (A[i]==0) { count++; i++; } for (int i-1; i<n; i*=5) A[i]=count; Activate Windows Go to Settings to activate

Answer rating: 100% (QA)

a The given code has a nested loop The outer loop runs n times and the inner loop runs i times The ... View the full answer