Question 11492 – APPSC-2012-DL CA
March 27, 2024Question 11495 – APPSC-2012-DL CA
March 27, 2024Question 11493 – APPSC-2012-DL CA
Time complexity of Binary search is
Correct Answer: C
Question 23 Explanation:
Time complexity of binary search is O(logn).
O(n)
O(n2)
O(log n)
O(n log n)