Time complexity in the worst case, Computer Engineering

Assignment Help:

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.


 

 


Related Discussions:- Time complexity in the worst case

Face recognition using java, how we get a perfect tutorial for face recogn...

how we get a perfect tutorial for face recognition using java

What is synchronous reset, What is Synchronous reset? Synchronous reset...

What is Synchronous reset? Synchronous reset: Synchronous reset logic will synthesize to smaller flip-flops, mainly when the reset is gated along with the logic generating t

What is the significance timescale directive, What is the significance Time...

What is the significance Timescale directive? Defines time units and simulation precision (smallest increment). Syntax 'timescale TimeUnit / PrecisionUnit TimeUnit =

recycling from e-waste to resources , Make at least 6 web pages with good ...

Make at least 6 web pages with good formatting, color balance and presentation on any one of the following topics:- 1.    Recycling from E-waste to resources 2.    Light and So

Target - data phase, Target abort -computer architecture: Usually, a t...

Target abort -computer architecture: Usually, a target holds DEVSEL# asserted through the final data phase. However, if a target desserts DEVSEL# before disconnecting without

What is hashing, What is Hashing? Hashing: Hashing gives the direct acc...

What is Hashing? Hashing: Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing functio

Operating system., what is the minimum number of page faults for an optimal...

what is the minimum number of page faults for an optimal page replacement strategy?

What is the size limitation of an access database, Size limitation does not...

Size limitation does not relate to number of records in a table within a database. Forms, reports, macros, and modules also add to database size, but is rather minimal compared to

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd