Suppose you have to implement an algorithm to remove from the ring buffer all items whose timestamps are within a range [t1, t2), that is remove all items x for which t1 ≤ x.time < t2. Explain why such an algorithm cannot be implemented with worst-case complexity θ(log n).

Answer rating: 100% (QA)

For a buffer which is not sorted we cannot identify all the items in logn a... View the full answer