Question: 13. In an array-based implementation of the ADT list, the makeRoom method does the most work when a. new position is 1 b. newPosition is

13. In an array-based implementation of the ADT list, the makeRoom method does the most work when a. new position is 1 b. newPosition is n C. newPosition is n/2 d. new Position is n-1 14. In an array-based implementation of the ADT list, what is the best case performance of the make Room method? a. 0(1) b. O(log n) C. O(n) d. O(n) 15. In an array-based implementation of the ADT list, what is the worst case performance of the makeRoom method? a. O(n) b. O(n) C. Odlog n) d. 0(1)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
