Please help me answer these questions, I am really confused. I will give amazing

Question

Please help me answer these questions, I am really confused. I will give amazing ratings and points. Answer completely as prompt asks. Part 3: Running time of Linked List and ArrayList functions In this section, you will analyze minimum time needed to implement several operations on a Linked List and Array List. In your HW3_3.txt file, in a section labeled Part 3, give the minimum required running time to execute each of the following operations in a doubly linked list with head and tail pointers, and Array List in the worst case, using Big- notation, assuming n is the number of elements in the list. Following each expression, include a 1-2 sentence argument about why an algorithm to perform the given operation could not run faster than the bound you give. As above, full credit will be given only for tight Big-2 bounds. That is, it is not sufficient to say that all operations take (1). This is trivially true for any piece of code. (Though in some cases this will be the tightest Big-2 bound).

Explanation / Answer

1. Making a copy of the list:
   ArrayList: Big-Omega(n)
   LinkedList: Big-Omega(n)
  
2. Adding a value to the end of the list
   ArrayList: Big-Omega(1)
   LinkedList: Big-Omega(1)

3. Removing the first value from the list
   ArrayList: Big-Omega(n)
   LinkedList: Big-Omega(1)

4. Removing the last value from the list
   ArrayList: Big-Omega(1)
   LinkedList: Big-Omega(1)

5. Determining whether the lit contains some value V
   ArrayList: Big-Omega(n)
   LinkedList: Big-Omega(n)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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