Find Big-O notation for the following algorithm: int function9(int n) { int ij for (i-0; in;...

Question

Question

Find Big-O notation for the following algorithm:

int function9(int n) { int ij for (i-0; in; i++) for (0; j<n; j++ if (j1) break return j; }

engineering Computer-Science

Answer 1

Answer #1

Here is the answer..

Gien: nt fondtion nt n) break Big-O rotation is 1 outer loop execytas h-Tmes Tha 1 tme mre loap tself eneates b Couse when et

If there is no break statement in if condition the the Big-O notation for the function is O( $n$ )

If you have any doubts please COMMENT...

If you understand the answer please give THUMBS UP...

Answer 2

Similar Homework Help Questions

Big-O notation. Consider the following function. int func1(int n) { int sum = 0, i; for(i...

Big-O notation. Consider the following function. int func1(int n) { int sum = 0, i; for(i = 0; i<n; i++;) { sum += i; return sum; } Express the running time of func1 as a function of n using big-O notation. Write a function that has the same functionality as func1, but runs in O(1) time.
What is the big o cost of this method? int count = 0; int i =...

What is the big o cost of this method? int count = 0; int i = 1; while(i < n){ for (j = 1; j < n*n; j *= n) { count++; } i *= 2; } System.out.println(count);
b. what is the order (big -o) of this algorithm? 11. To answer this question, consider...

b. what is the order (big -o) of this algorithm? 11. To answer this question, consider the n, consider the following algorithm: for (int i-0; i<ni i++) for (int j = 0; j <= i; j++) // three assignment statements in body of this inner loop a. (6 pts) Exactly how many assignments (in terms of n) are made in this algorithm?

#include<stdio.h> int functionl (int x, int y); int main() int ij=2,k; for(i=1;i<=5; i++) k = function1(ij);...

#include<stdio.h> int functionl (int x, int y); int main() int ij=2,k; for(i=1;i<=5; i++) k = function1(ij); printf("k=%d\n",k); return 0; int function] (int x, int y) int z; z=x*2+y; return z;
Given the following code, find their big(O) for I in range of n: for j...

Given the following code, find their big(O) for I in range of n: for j in range of n: for k in range of 10000: print(“test”) If an algorithm takes n3+1000n2+1000n2+9999 time, what is the Big O for this algorithm? Proof: O(nK) < O (2n), need to do some research on polynomial time and exponential time.
1. Find the Big Oh notation for the expressions below A. 10,000,000 B. 1+2+3+4+...+n C. 50,000+log(n^2000)+500n...

1. Find the Big Oh notation for the expressions below A. 10,000,000 B. 1+2+3+4+...+n C. 50,000+log(n^2000)+500n D. 5,000(n^2)+7,000,000 E. 700n^3+n^2+50,000,000n+1 F. 2^(n+3)+300(n^3) 2. Identify time complexity in Big O notation for the program segments A. sum=0; for(i=1;i<=n;i=i*3) sum++; B. sum=0; for(int i=1;i<3^n;i=i*3) sum=sum++; for (int j=n;j<0;j--) sum--; C. sum=0; for(i=n;i>=1;i--) for(j=i;j<=n;j++) sum++; D. sum=0; for(i=1;i<=10;i++) for(int j=1; j<=n*n; j++) sum++;

Find the time complexity for the following program segment in Big O notation for (i=n; i>=1;...

Find the time complexity for the following program segment in Big O notation for (i=n; i>=1; i=i/4) print "*";
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a...

(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a list of n integers) for i = 2 to n do c= j=i-1 while (j > 0) do if ra; then break end if 4j+1 = a; j= j-1 end while j+1 = 1 end for 14: return 0.02. 1, 15: end procedure Answer the following questions: (1) Run the algorithm with input (41, 02, 03, 04) = (3, 0, 1,6). Record the values...
Please specify Time and Space Complexities in terms of the Big-O notation. for (int j =...

Please specify Time and Space Complexities in terms of the Big-O notation. for (int j = 1; j < n; j = 2 * j) sum += j; Question 8 options: O(n^2) O(n log n) O(log n) O(n) O(1)

The Big O notation for an algorithm with exactly 50 constant time operations is a. O...

The Big O notation for an algorithm with exactly 50 constant time operations is a. O ( 50 ) b. 0(1) C. 0, 50 N ) d. 50.0(1)