Arrange in increasing order of average case complexity Selection-sort,…
2021
Arrange in increasing order of average case complexity Selection-sort, Quick-sort, Linear search, Binary search
- A.
Quick-sort, Selection-sort, Binary search, Linear search
- B.
Linear search, Binary search, Selection-sort, Quick-sort
- C.
Binary search, Linear search, Quick-sort, Selection-sort
- D.
Selection-sort, Quick-sort, Linear search, Binary search
Attempted by 283 students.
Show answer & explanation
Correct answer: C
Step 1: Analyze average case complexity of each algorithm.
Binary search: O(log n) – divides search space in half each step.
Linear search: O(n) – checks each element sequentially.
Quick-sort: O(n log n) – divides and conquers with average partitioning.
Selection-sort: O(n²) – finds minimum element in each pass.
Step 2: Order by increasing complexity: O(log n) < O(n) < O(n log n) < O(n²).
Thus, the correct order is: Binary search, Linear search, Quick-sort, Selection-sort.