Question

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++;

Answer 1