# Ace test series

1 vote
49 views

0
everytime we are searching larger part which is $\large \frac{2n}{3}$

the option you selected is even better than binary search because we are searching only $\large \frac{n}{3}$ elements recursively but that's the best case.

## Related questions

1 vote
1
97 views
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is- 1. (n+e)*log^2n 2. n^2 3. n^2*logn 4. n*logn