Computer Science · Algorithms
Arrange the following in increasing order of their asymptotic time complexities: (A) Insertion sort (best case) (B) Bubble sort (worst case) (C) Binary Search (worst case) (D) Merge sort (worst case)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(C), (A), (D), (B)✓
- 2(A), (B), (C), (D)
- 3(D), (A), (C), (B)
- 4(A), (C), (B), (D)
Correct answer
(C), (A), (D), (B)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms