Question 11492 – APPSC-2012-DL CA
March 27, 2024
Question 11495 – APPSC-2012-DL CA
March 27, 2024
Question 11492 – APPSC-2012-DL CA
March 27, 2024
Question 11495 – APPSC-2012-DL CA
March 27, 2024

Question 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).
A
O(n)
B
O(n2)
C
O(log n)
D
O(n log n)
Sreenivas Kavarthapu
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!