Which of the following algorithms have same order of complexity ? A. Deletion from Queue B. Worst case Search in Binary Search tree C. Insertion in Stack D. Quick Sort worst Case Choose the correct answer from the options given below :
To find algorithms with the same order of complexity, we need to determine the time complexity for each given operation:
Comparing the determined complexities:
Algorithms A (Deletion from Queue) and C (Insertion in Stack) both have a time complexity of $O(1)$, meaning they have the same order of complexity.
| List-I | List-II |
| Electronic Configuration | First Ionisation energy (kJ mol$^{-1}$) |
| (A). ns$^2$ | (I). 2100 |
| (B). ns$^2$np$^1$ | (II). 1400 |
| (C). ns$^2$np$^3$ | (III). 800 |
| (D). ns$^2$np$^6$ | (IV). 900 |
| List-I | List-II |
| Spectroscopy | Property |
| (A). Raman | (I). Polarizability |
| (B). FTIR | (II). Dipole Moment |
| (C). UV-Visible | (III). Absorbance |
| (D). NMR | (IV). Spin |