Question:

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:

Updated On: Nov 4, 2024
  • (A), (B), (C), (D)
  • (B), (D), (A), (C)
  • (B), (A), (C), (D)
  • (B), (C), (A), (D)
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

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²)).
Was this answer helpful?
0
0