Time complexity in the worst case, Computer Engineering

Speicified the following piece of code:

int i = 1;

int j = 4;

while (i<(n*n)&& j<(n*n*n*n))

    {

     if (i%3 == 0) i+=3;

     else i+=4;

 

     if (j%2 == 0) j*=4;

     else j*=2;        

    }

      Verify its time complexity in the worst case. You must display your computations.


 

 

Posted Date: 3/22/2013 3:21:31 AM | Location : United States







Related Discussions:- Time complexity in the worst case, Assignment Help, Ask Question on Time complexity in the worst case, Get Answer, Expert's Help, Time complexity in the worst case Discussions

Write discussion on Time complexity in the worst case
Your posts are moderated
Related Questions
Question 1: (a) Explain the concept behind Pre-Compositing Adobe After Effects. (b) Briefly describe the Wiggler function in Animation help in Adobe After Effects. (c)

how binary codes are used

4) A positive integer is entered through the keyboard;write a function to find the binary equivalent of this number using recursion.

a) Briefly describe the relationship between distributed computing, mobile computing and pervasive computing. b) Suppose the following scenario, which demonstrate the possibili

What is line option explicit Line explicit function makes the compiler to recognize all the variables which are not particular by the dim statement. This command significantly

Explain Implementation techniques Implementation techniques(e.g. remote invocation, HTTP). An event-based cooperation can be executed using message passing or it can  be based

Determine about the Pick Device Light Pens The light pen used to select screen positions by detecting the light coming from points on the CRT screen. These are sensitive to

How to calculate the flowchart

Stack unwinding in C++ is a process during exception handling when the destructor is known for all local objects the place where the exception was thrown and where it is caught.