search
Log In
0 votes
188 views

Can anyone please explain

in Algorithms 188 views
0
Is answer is D) ??
0
A is the answer
0
Average case is 'logn' whereas worst case would be O(n). So i think A can be the choice.
0
Please specify the test-series name

Please log in or register to answer this question.

Related questions

0 votes
2 answers
1
0 votes
1 answer
2
82 views
Let B1, B2, B3, B4, B5 be five matrices of dimensions 15 x 20, 20 x 17, 17 x 22, 22 x 16, 16 x 23 respectively. The minimum number of scalar multiplications required to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method _____
asked Aug 30, 2018 in Algorithms mitesh kumar 82 views
1 vote
0 answers
3
196 views asked Aug 29, 2018 in Algorithms ben10 196 views
2 votes
2 answers
4
389 views
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)$
asked Mar 27, 2018 in Algorithms Aishwarya Gujrathi 389 views
...