search
Log In
1 vote
49 views

in Algorithms 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.

Please log in or register to answer this question.

Related questions

1 vote
0 answers
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
asked Jan 29, 2019 in Algorithms Psnjit 97 views
0 votes
3 answers
2
0 votes
0 answers
3
162 views asked Jan 23, 2019 in Algorithms Shankar Kakde 162 views
–1 vote
1 answer
4
65 views asked Jan 14, 2019 in Algorithms Shankar Kakde 65 views
...