Consider the following algorithms and their running times :
Algorithms |
Complexities |
(A) Breadth First Search |
(I) $\theta(v+E)$ |
(B) Rabin-Karp Algorithm |
(II) $O(v+E)$ |
(C) Depth-First Search |
(III) $\theta((n-m-1) m)$ |
(D) Heap sort (worst case) |
(IV) $O\left(n^2\right)$ |
(E) Quick sort (worst case) |
(V) $O(n \lg n)$ |
Which one of the following is correct?
- $\text{(A)-(III), (B)-(II), (C)-(I), (D)-(IV), (E)-(V)}$
- $\text{(A)-(II), (B)-(III), (C)-(I), (D)-(IV), (E)-(V)}$
- $\text{(A)-(II), (B)-(III), (C)-(I), (D)-(V), (E)-(IV)}$
- $\text{(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)}$