What is the big-o running time of the given code

Assignment Help Computer Engineering

Reference no: EM13698082

Question 1: What is the Big-O running time of the subsequent code fragment?

Assume lst1 has N items, and lst2 is initially empty.

public static void add( List<Integer> lst1, List<Integer> lst2)

{

for ( Integer x : lst1 )

lst2.add(0, x); // add to front

}

a. If an ArrayList is passed for lst1 and lst2. Describe your answer.

b. If a LinkedList is passed for lst1 and lst2. Describe your answer.

Reference no: EM13698082

Questions Cloud

How do you initiate an array with a proper amount of values : How do you initiate an array with a proper amount of values?

What are the ethical implications of this : Many of the studies researching cell phones safety have been funded by the cell phone industry - What are the ethical implications of this?

What is big-o running time of subsequent code fragment : What is the Big-O running time of the subsequent code fragment - If an ArrayList is passed. Describe your answer.

What is big-o running time of following code fragment : What is the Big-O running time of the given code fragment and If an ArrayList is passed for lst. Describe your answer.

What is the big-o running time of the given code : What is the Big-O running time of the subsequent code fragment and If an ArrayList is passed for lst1 and lst2. Describe your answer.

Provide a laymans explanation of uml : Describe one scenario in which it would be advantageous for you to use a definite loop as opposed to an indefinite loop when developing a program. Provide a rationale for your response.

Design a java application using the list data structure : You are to design a Java application using the list data structure to manage your contact information. Each contact may have the subsequent data:

Byte-stuff the subsequent frame payload : Byte-stuff the subsequent frame payload in which E is the escape byte, F is the flag byte, and D is a data byte other than an escape of a flag character.

Simpl program prove by structural induction : Let c be an arbitrary SIMPL program and assume that judgment ßs' holds for some store s'. Prove by structural induction that x Î pre(s'), where pre(s') denotes the preimage of s'.

User Account

All Pages