Question

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

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

Answer 1

c.O(n)

Step-by-step explanation:

In the array based list implementation of the ADT the worst case time complexity of the getEntry method is O(n).In the worst case it has to travel upto n elements then it has to do the operation.In doing so the time complexity will come out to be O(n).So we conclude that the answer to this question is O(n).