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
The situation when both transmitter and receiver have to work in tandem is referred to as? The situation while both transmitter and receiver have to work into tandem is termed

how to solve pebble merchant problem.? coding for it..!

Classify computer systems according to capacity. How they are different from computers according to the classification of technology. Provide comparative study also.

What are the advantages of Public Key Cryptography? Advantages of Public Key Cryptography are illustrated in below: a) Increased convenience and security and b) Electro

Classification according to pipeline configuration: According to the configuration of a pipeline, the following parts are recognized under this classification: Unifunct

For executing recursive function the data structure used is: For executing recursive function, stack is used as a data structure.

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome

what is robot?explain different types of robots with respect to joints.

(a) Name five important activities involved in a digital forensic investigation. (b) Briefly describe the three types of data that a forensic examiner has to work with. Whic

What is the draw back of assigning one bit position to each control signals? Assigning individual bits to every control signal results in long microinstructions due to the numb