#9 What is time complexity of fun()? int fun(int n) { int count = 0; for...

Question

Question

#9

What is time complexity of fun()?

int fun(int n)

{

int count = 0;

for (int i = n; i > 0; i /= 2)

for (int j = 0; j < i; j++)

count += 1;

return count;

}

Group of answer choices

O(n^2)

O(nLogn)

O(n)

O(nLognLogn)

engineering Computer-Science

Answer 1

Answer #1

Option 3

O(n)

Answer 2

Similar Homework Help Questions

1). What is the complexity of the following code snippet? { for (int count2 = 0;...

1). What is the complexity of the following code snippet? { for (int count2 = 0; count2<n; count2++) { /*some sequence of O(1) step*/ } } select one: a. O(N^2) b. O(Log N) c. O(1) d. O(N!) 2). What is the complexity of the following code snippet? for (int count = 0; count<n; count++) { printsum(count) } select one: a. We need to know the complexity of the printsum() function. b. O(Log N) c. O(1) d. O(N) e. O(N^2) 3)....
Question 2 Consider the following algorithm Fun that takes array A and key Kas Fun(AO,...,n -...

Question 2 Consider the following algorithm Fun that takes array A and key Kas Fun(AO,...,n - 1], K) count = 0 for i = 0 ton - 1 do for j = i +1 to n - 1 do if A[i] + A[j] == K then count = count +1 end if end for end for return count What is the best case time complexity of the above algorithm?! (log(n)) O(1) (n) (na) Previous o H H 9
Using C++ please explain What is the Big-O time complexity of the following code: for (int...

Using C++ please explain What is the Big-O time complexity of the following code: for (int i=0; i<N; i+=2) { ... constant time operations... Select one: o a. O(n^2) O b. O(log n) c. O(n) O d. 0(1) What is the Big-O time complexity of the following code: for(int i=1; i<N; i*=2) { ... constant time operations... Select one: O O a. O(n^2) b. 0(1) c. O(n) d. O(log n) O What is the Big-O time complexity of the following...

Show your work Count the number of operations and the big-O time complexity in the worst-case...

Show your work Count the number of operations and the big-O time complexity in the worst-case and best-case for the following code int small for ( i n t i = 0 ; i < n ; i ++) { i f ( a [ i ] < a [ 0 ] ) { small = a [ i ] ; } } Show Work Calculate the Big-O time complexity for the following code and explain your answer by showing...
Choose the time complexity of the following algorithm. int function1(int Z[ ], int n, int b)...

Choose the time complexity of the following algorithm. int function1(int Z[ ], int n, int b) { for (int i = 0; i < n; i++) { if ( Z[i] == b ) return i; } return -1; } a. O(1) b. O(n) c. O(mn) d. O(n*n)
Which big-O expression best characterizes the worst case time complexity of the following code? public static...

Which big-O expression best characterizes the worst case time complexity of the following code? public static int foo(int N) ( int count = 0; int i1; while (i <N) C for (int j = 1; j < N; j=j+2) { count++ i=i+2; return count; A. O(log log N) B. O(log N2) C. O(N log N) D. O(N2)

Consider the following loop nest: int sum = 0; for(int j = 0; j < N...

Consider the following loop nest: int sum = 0; for(int j = 0; j < N * N; j += 2) for(int i = 2*N; i > 0; i--) sum++; What is the Big-O behavior? Group of answer choices O(1) O(log N) O(N) O(N log N) O(N2) O(N3) 2.Consider the following loop nest: int sum = 0; for(int j = 1; j < N; j *= 2) for(int i = 0; i < N; i += 2) sum++; What is...
What is the time complexity of the following code segment? for (int i = 0; i<n;...

What is the time complexity of the following code segment? for (int i = 0; i<n; i--) if (a[i] != 0) sum = a[i]; What is the time complexity of the following code segment? for (int i = 0; i<10; i++) if (a[i] != 0) sum += a[i]; What is the time complexity of the following code segment? for (int i = 0; i<n/2; i++) if (a[i] != 0) sum += a[i]; What is the time complexity of the following...
Hello, i need help finding the time complexity(big0) for n..(java) a) for (int a = 0;...

Hello, i need help finding the time complexity(big0) for n..(java) a) for (int a = 0; a < n; a = a + C) for (int b = 0; b < 10; b++) s[a] += b * s[a]; b) for (int a = 1; a < n; a = a * C) for (int j = 0; j < a; j++) s[a] += j * s[a]; c) for (int i = 1; i < n; i...

discrete math (1) (15 pts) Time Complexity Analysis 1) (5 pts) What is the time complexity...

discrete math (1) (15 pts) Time Complexity Analysis 1) (5 pts) What is the time complexity of the following code segment? Explain your answer; otherwise, you can't get full mark from this question. for(int i=1; i<n; i*=2) { sum-0; sum++; Answer: 2) (5 pts) What is the time complexity of the following code segment? Explain your answer; otherwise, you can't get full mark from this question. for(int j=0; j<n; j++){ for (int k=0; k<n; k++) { for (int =0; i<n;...