3 views

Which of the following operations can be performed in $O(logn)$ time or faster on a sorted array $A$?($n$ denotes the size of array)

1. Search$(A, x)$
2. Find-Minimum$(A)$
3. Delete$(A, x)$

Choose the correct option

1. A, B & C
2. B & C
3. A & B
4. A & C
in Others | 3 views