Question

i just need from indexed set to iterator remove. last half of the chart

Exercises table with the order of growth of the indicated operations for the hentation approach. Assume the list holds N fill in the following table with 31. Fill in the fol 417 given implementation Exercise 13):

Answer 1

Since you have not mentioned the meaning of ABList, LBList and SortedABList, I am assuming that ABList is Array based list, LBList is linked list and SortedABList is Sorted Array based list.

NOTE: Please upvote all my answers if they are helpful to you :).

indexed add:

• ABList -> takes O(n)
• LBList -> takes O(n)
• SortedABList -> takes O(n)

indexed set:

• ABList -> takes O(1)
• LBList -> takes O(n)
• SortedABList -> takes O(1)

indexOf:

• ABList -> takes O(n)
• LBList -> takes O(n)
• SortedABList -> takes O(n)

indexed get:

• ABList -> takes O(1)
• LBList -> takes O(n)
• SortedABList -> takes O(1)

iterator next:

• ABList -> takes O(1)
• LBList -> takes O(1)
• SortedABList -> takes O(1)

iterator remove:

• ABList -> takes O(1)
• LBList -> takes O(1)
• SortedABList -> takes O(1)