Question: Example of Program Analysis j = n while ( j >= 1 ) { for ( i = 1; i

Example of Program Analysis

j = n

while ( j >= 1 )

{

for ( i = 1; i <= j; i++ )

x = x + 1;

j = j / 2;

}

1) Determine T(n) where T(n) = the number of times x=x+1 is executed.

2) Determine T(n) for the entire code.

3) What is the asymptotic analysis of 1 and 2?

Note

Geometric Sum:

a + ar1 + ar2 + . + arn = a(rn+1 1)/(r 1), where r != 1

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!

Q:

So far in our study of recursion, we identified a few common recursive number sequences, such as the Fibonacci numbers. Number sequences like this are not recursive algorithms themselves -- their...

Q:

main.cpp #include #include "library.h" using namespace std; /* Modify the sorting functions in library.cpp according to the prompts from the assignment. Update the content for the test array and/or...

Q:

Calculate the time complexity of the following code snippets: [ 1 0 ] a ) for ( i = 1 ; i

Q:

Problem 3 : ( 8 pts ) For each piece of pseudocode below, give its \ Theta estimate. Include a brief informal explanation. a ) AlgorithmA ( n ) for i 1 to n do for j 1 to n ^ 2 + 1 do for k 1 to n do...

Q:

oblem 3 Consider the following 5 statements 2 of the statements are false in general Determine which 2 statements are false by testing out each statement on an appropriate matrix like we did with the...

Q:

Complete Practice Exercise 14-I, Common Sizing, found at the bottom of page 551 and the top of page 552, do the Required portion only. Complete Practice Exercise 14-II Trend Analysis found in the...

Q:

For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n)...

Q:

Please analyse each function and explain step by step,give an input and output ,explain why ? and write complexity . (1)def maximum(lst): lower = 0 upper = len(lst)-1 while lower

Q:

What is the Big - \ Theta ( tight bound ) of the func ( ) below as a function of n assuming that the func 1 ( n ) is Big - \ Theta ( n ) ? Prove your answer. Algorithm 1 def func ( n ) : j = n while...

Q:

3) For each function with input argument n, determine the precise number of fundamental operations that will be executed. Your answer should be a function of n in closed form. Note that closed form...

Q:

profile-image Time remaining: 00 :09 :50 Accounting Up To Keep up to date with security updates fins, and improvements, con Check for Updates Professor Hawkins 1.. What are the first

Q:

Present Value of the Terminal Value Although there are two different ways of deriving terminal value, either method must be discounted back to the valuation date. Open the attached Excel file and go...

Q:

Find the gradient of the line passing through each of the following pairs of points. (a) A(2, 3) and B(7, 5) (b) P(-2, 8) and Q(1,-1)

Q:

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

Q:

Question How is health plan coverage for retirees reflected by the employer for accounting purposes?

Q:

Question Can a self-employed person (sole proprietor or partner in an unincorporated business) or S corporation shareholder-employee be covered under his businesss health insurance plan and obtain...

Q:

Question What is the advantage of a voluntary DBO plan?