Question

4. In an array-based implementation of the ADT list, what is the best case performance of the contains method? a. O(1) b. O(log n) C. O(n) d. O(nº) 5. In an array-based implementation of the ADT list, what is the worst case performance of the contains method? a. O(n) b. O(n) C. O(log n) d. 0(1) 6. In an array-based implementation of the ADT list, what is the performance of the contains method when the entry is not in the list? a. O(n) b. O(n?) C. O(log n) d. 0(1)

Answer 1

4)  a.  O(1)
in best case the item we are searching for is present at the first position of the array.
in that case it only takes one single operation.
5)  a.  O(n)
in worst case we might need to go through all positions of the array to find the item we are searching for.
so, in worst case it takes n operations.
6)  a.  O(n)
when the item we are searching for does not contain inside the array.
then we need to go through all n elements of array to verify that.
so, it takes n operations.