Find - notation in terms of n for the pseudocode below. Provide a short answer. for...

Question

Question

Find - notation in terms of n for the pseudocode below. Provide a short answer. for i = 1 to ign for j = 1 ton for k = 1 to i

engineering Computer-Science

Answer 1

Answer #1

Then For every value of , expression x = x + 1 will run n * i times.

So for i = 1 , x = x + 1 will run n * 1 times.

for i = 2 , x = x + 1 will run n * 2 times

and so on..

Therefore :

Total times x = x + 1 will run is

$f(n) = \sum_{i = 1}^{lg(n)}(n* i) = n * \sum_{i = 1}^{lg(n)}(i) =n * ( (lg(n) * lg(n) + 1) / 2)$

so $f(n) = \theta (n * lg(n)^{2})$

Answer 2

Similar Homework Help Questions

10 pts Question 2 Find 0 - notation (as a function of n) for the number...

10 pts Question 2 Find 0 - notation (as a function of n) for the number of times the statement "x x +1" is executed in the following pseudocode: for i 1 to n3 for j 1 to i х%3Dх+1
Describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms...

Describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. Show your work b) void func(int n) { for (int i = 0; i < n; i = i + 10) { for (int j = 0; j < i; ++i) { System.out.println("i = " + i); System.out.println("j = " + j);
Find ⊝ - notation for the expression: Find - notation for the expression: (1+2+...+n) lgn +...

Find ⊝ - notation for the expression: Find - notation for the expression: (1+2+...+n) lgn + 81nlg? n + ()" + 2256 2256 on? Ign 21 n3 nlgn nlgn (1)"

se Factorial Notation Question Write the first three terms of the sequence whose general terms an--(n-1)! 2 Provide...

se Factorial Notation Question Write the first three terms of the sequence whose general terms an--(n-1)! 2 Provide your answer below: 4 Previous
[10 marks] consider the following pseudocode: p := 0 x := 2fori:= 2ton p := (p...

[10 marks] consider the following pseudocode: p := 0 x := 2fori:= 2ton p := (p + i ) * x a) How many addition(s) and multiplication(s) are performed by the above pseudocode?b) Express the time-complexity of the pseudocode using the big-Θ notation.) Trace the algorithm, below, then answer (c) and (d): Procedure xyz(n: integer) s := 0, for i:= 1 to n, for j:= 1to i, s:= s+ j*(i− j+ 1) return s c) What is the time-complexity for...
Provide the Big‐O notation for the following lines of Java code, make sure you include all...

Provide the Big‐O notation for the following lines of Java code, make sure you include all the necessary steps to reach your answer to receive any credit: a. for (i = 10; i < n – 8; i++) { for( j = 1; j < m; j *= 2) x = i + j; } b. for(k = 0; k <= m; k += 2) { l = 0; while(l < n/2) { y = l * 4 – x;...

Explain please II. (7 points) Consider the following bit of pseudocode: for (int k = 1; ks Ign; k++) (for (int i = 1; i r: i++) Print "Hello World"; for (int j-1;jsn:j++) Print "Hello Worl...

Explain please II. (7 points) Consider the following bit of pseudocode: for (int k = 1; ks Ign; k++) (for (int i = 1; i r: i++) Print "Hello World"; for (int j-1;jsn:j++) Print "Hello World" when n = 2, how many times will "Hello World" be printed? When n 4, how many times will "Hello World be printed? O Assuming that the print is the basic operation, what is the complexity function of this pseudocode? II. (7 points) Consider...
Question 20 Find a theta notation for the number of times the statement x = x...

Question 20 Find a theta notation for the number of times the statement x = x + 1 is executed: 12 while i<n) 12 - - 1 02") (1) e(n) edign) On ign) edgign)
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++;

Let A[1..n] be an array with n elements. Consider the Count-Occurrence algorithm with the pseudocode below....

Let A[1..n] be an array with n elements. Consider the Count-Occurrence algorithm with the pseudocode below. Count-Occurrence(A, n, k). count 0 for j = 1 to n if A[j] ==k count = count+1 print count Which of the following is the correct loop invariant for the for loop? At the start of each iteration jof the for loop, count represents the number of times that k occurs in the subarray A[1.j]. At the start of each iteration of the for...