APFIVE Binary Search Time Complexity
What is the time complexity of the binary search algorithm when performed on a sorted array?
A
O(1)
B
O(n)
C
O(\log n)
D
O(n^2)
Question Leaderboard
| Rank | |||||
|---|---|---|---|---|---|
| #1 | rpatton | 1 | 1 | 0m 16s | 84 |
| #2 | soniahalepota2005 | 1 | 2 | 0m 23s | 67 |
| #3 | afeldman0610 | 1 | 2 | 1m 08s | 22 |
| #4 | bhavneet.singhal | 0 | 1 | 0m 05s | -15 |
| #5 | tianbo.shen | 0 | 1 | 0m 06s | -16 |
| #6 | mahmoudjibrin08 | 0 | 1 | 0m 08s | -18 |
| #7 | hxuna0217 | 0 | 1 | 0m 17s | -27 |
| #8 | gtsak31 | 0 | 1 | 1m 26s | -96 |
| #9 | ashvikkumawat | 1 | 1 | 59m 55s | -3,495 |
Items per page:
10
1 – 9 of 9