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

Are there any special rules about inlining, Are there any special rules abo...

Are there any special rules about inlining? Yes, there are some rules about inlining - a.) Any source files which used inline function should contain function's definition.

Display frames (horizontal and vertical lines) in lists, How can you displa...

How can you display frames (horizontal and vertical lines) in lists? You can show tabular lists with horizontal and vertical lines (FRAMES) using the ULINE command and the syst

#title.un ba lance out put differential amplitude, #questi on.. How it wor...

#questi on.. How it works Explain explain

What is the advantage of running the vuser as thread, VuGen gives the facil...

VuGen gives the facility to use multithreading. This enables more Vusers to be run pergenerator. If the Vuser is run as a process, the similar driver program is loaded into memory

Dialog-task updates, Dialog-task updates are Synchronous updates.

Dialog-task updates are Synchronous updates.

Instruction pipelines, Instruction Pipelines As discussed previous, the...

Instruction Pipelines As discussed previous, the stream of instructions in the instruction implementation cycle, can be realized through a pipeline where overlapped implementat

Define functionality of application layer in tcp/ip protocol, Define the fu...

Define the functionality of application layer in TCP/IP protocol stack? Function of Application Layer: The top layer within the Internet reference model is the applicatio

Running time - metrics for performance evaluation, Running Time - Metrics f...

Running Time - Metrics for performance evaluation: Running time is amount of time consumed in execution of an algorithm for a provided input on N-processor based parallel comp

Write the truth table and simplify karnaugh map, For F = A.B.C + B.C.D ...

For F = A.B.C + B.C.D ‾ + A‾.B.C , write the truth table and simplify using Karnaugh map . And. Simplification of Logic Function F = A B C + B C‾ D + A‾ B C. Therefore the

What is difference between cobol and vs cobol ii, In using COBOL on PC we h...

In using COBOL on PC we have only flat files and the programs can access only limited storage, while in VS COBOL II on M/F the programs can access up to 16MB or 2GB depending on th

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages