The sorted reference-based implementation of the tableDelete operation is ______.
A)O(1)
B)O(log n)
C)O(n)
D)O(n²)

Question

Quizplus · Accepted Answer

The sorted reference-based implementation of the tableDelete operation is O(n) because, after finding the element to delete (which can be done in O(log n) time if binary search is used), the algorithm must shift all subsequent elements to fill the gap left by the deleted element, which takes O(n) time in the worst case.

The Sorted Reference-Based Implementation of the TableDelete Operation Is ______