Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
Match the LIST-I with LIST-II
|
LIST - I Algorithm |
LIST - II Complexity |
||
|
A. |
Insertion Sort |
I. |
O(log n) |
|
B. |
Binary Search |
II. |
O(n2) |
|
C. |
Quick Sort |
III. |
O(n - 1) |
|
D. |
Selection Sort |
IV. |
O(n log n) |
Choose the correct answer from the options given below:
1
A - III, B - I, C - IV, D - II
2
A - II, B - III, C - I, D - IV
3
A - I, B - II, C - IV, D - III
4
A - II, B - III, C - IV, D - I