Arrange the following in the increasing order of their asympotic complexities: (A) Insertion sort (b

Question

Arrange the following in the increasing order of their asympotic complexities: (A) Insertion sort (best case) (B) Bubble sort (worst case) (C) Binary Search (worst case) (D) Merge sort (worst case)

Accepted Answer

Complexities:

(C) Binary search, worst case: \(O(\log n)\)
(A) Insertion sort, best case: \(O(n)\)
(D) Merge sort, worst case: \(O(n \log n)\)
(B) Bubble sort, worst case: \(O(n^2)\)

Increasing order: C, A, D, B.

Answer: (D)

Question 39

📘 Step-by-Step Solution & Detailed Explanation:

Practice Similar Sorting Questions

Prepare for CUET-MCA Under Real Exam Conditions