216 views
0 votes
0 votes
A slight modification to binary search algorithm where it is split into sets of size one thirds and two thirds instead of equal sizes. What will be the recurence relation in worst case

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
3
vivek1211 asked Oct 2, 2023
255 views
T(n) = T(n^1/2) + ndoing this in substitution method gives the ans as O(n)but using tree recursion gives the ans as O(nlogn)which of these are correct and which has to be...
0 votes
0 votes
1 answer
4
practicalmetal asked Sep 15, 2023
340 views
Consider the following function:function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); }Find the worst case time complexity of function...