CSS
Prepare
Syllabus
MPT
Subjects
Practice
Resources
Back to topic
Try Yourself
Computer Science — Topic Quiz
Computer Science
Q 1 of 10
Single
Scroll
The worst-case time complexity of binary search on a sorted array is:
A
O(1)
B
O(log n)
C
O(n)
D
O(n log n)
Score:
0
Tip: press
Enter
to submit
Submit answer
Computer Science Quiz — Free CSS MCQs · CSS Prepare