# Test Series

188 views

0
0
0
Average case is 'logn' whereas worst case would be O(n). So i think A can be the choice.
0

## Related questions

1
277 views
What is the time complexity of T(n) = T(n/3) + T(n/9) +n?
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$