Question

.in the array based list implementation of the ADT what is the worst case time efficiency of the remove method?

a.O(n2)
b.O(1)
c.O(n)
d.O(logn)

Answer 1

c.O(n).

Step-by-step explanation:

In an implementation of an ADT based on array.The worst case time complexity of remove method is O(n).Since to remove an element from ADT(Abstract Data type) we have to traverse the array upto that element in worst case which will come after n elements so this will take tie and the time complexity will be O(n).