PA of Algorithms Q92
0. Give the correct matching for the following pairs:
| List-I | List-II | ||
| A. | O(logn) | P. | Selection |
| B. | O(n) | Q. | Insertion sort |
| C. | O(n log n) | R. | Binary search |
| D. | O(n2) | S. | Merge sort |
Codes:
(a) A – R B – P C – Q D – S
(b) A – R B – P C – S D – Q
(c) A – P B – R C – S D – Q
(d) A – P B – S C – R D – Q
- Option : D
- Explanation : Selection sort = O (n2) Insertion sort = O (n2) or (O(n) in best case) Binary Search = O (logn) Merge Sort = O (n logn) None of the options is true
