Question: int myfun 3 ( int [ ] A , int n ) { int i , j , s = 0 ; for ( i

int myfun3(int[] A, int n)
{
int i, j, s =0;
for (i =1; i <= n; i = i *2)
s = s + A[i];f
for (i =0; i < n; i++)
for (j = i +1; j < n; j++)
if (A[i]== A[j])
return -s;
return s;}
Using the \theta (theta) notation, what is the best-case running time of "myfun3"?
a)(n)
b

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!