Java Part 1: Answer options: O(1), O(n), O(n^2) ---------------------- Part 2: A

Question

Java

Part 1:

Answer options: O(1), O(n), O(n^2)

----------------------

Part 2:

Answer options: O(1), O(n), O(n^2)

-------------------------

Part 3:

Answer options: O(1), O(n), O(n^2)

What is the order of growth of the following operations for lists implemented with arrays? add to the beginning of a list Choose] add to the end of a list [Choose] delete from the beginning or middle of a listChoose] delete from the end of a list [Choose] determine if the list contains an element [Choose] retrieve an element at a specific position

Explanation / Answer

Part 1:

1. O(n) in case of ArrayList because it would require to shift all the existing elements by one position. O(1) in case of linked list.

2. O(1) in both ArrayList and Linked List.

3. O(n) in case of ArrayList because it would require to shift all the existing elements by one position. O(1) in case of LinkedList

4. O(1) in both ArrayList and LinkedList

5. O(1) in ArrayList and O(n) in LinkedList

6. O(1) in ArrayList and O(n) in LinkedList

Part 2:

1. O(1)

2. O(n)

3. O(1)

4. O(n)

5. O(n)

6. O(n)

Part 3:

1. O(1)

2. O(1)

3. O(1)

4. O(1)

5. O(n)

6. O(n)

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.