The time taken by binary search algorithm to search a keyin a sorted array of n elementsis

A

$$O(\log_{2}n)$$

B

$$ O(n) $$

C

$$ O(n \log_{2}n) $$

D

$$ O(n^{2}) $$