Question
Computer Science Question on Searching
Arrange the following in the ascending order of their time complexity.
Options:
(A) Worst Case of Linear Search
(B) Best Case of Binary Search
(C) Worst Case of Binary Search
(D) Worst Case of Bubble Sort
Choose the correct sequence from the options given below:
A
(A), (B), (C), (D)
B
(B), (D), (A), (C)
C
(B), (A), (C), (D)
D
(B), (C), (A), (D)
Answer
(B), (A), (C), (D)
Explanation
Solution
The correct order based on time complexity is: Best Case of Binary Search (O(1)), Worst Case of Linear Search (O(n)), Worst Case of Binary Search (O(log n)), and Worst Case of Bubble Sort (O(n²)).