Question

Arrange the following in the ascending order of their time complexity.
(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 1

The Correct Option is C

The following time complexities are considered for each algorithm case to establish their order:

• Linear Search (Worst Case): O(n)
• Binary Search (Best Case): O(1)
• Binary Search (Worst Case): O(log n)
• Bubble Sort (Worst Case): O(n^2)

Arranging these complexities in ascending order yields:

1. Binary Search (Best Case): O(1)
2. Linear Search (Worst Case): O(n)
3. Binary Search (Worst Case): O(log n)
4. Bubble Sort (Worst Case): O(n^2)

Consequently, the order of these algorithms by time complexity from smallest to largest is: (B), (A), (C), (D)