13,325 views

1 Answer

1 votes
1 votes

answer Wii be  O(n log4/3 n) using recursive tree method. 

Related questions

1 votes
1 votes
2 answers
1
mdboi asked Oct 28, 2022
742 views
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n
1 votes
1 votes
1 answer
2
ItzDc asked Jun 3, 2022
2,855 views
I can't figure out how to proceed and which case it's falling under after calculating h(n)
2 votes
2 votes
3 answers
3
sabir asked Nov 26, 2015
13,284 views
Which is right method to apply for this substitute or recursion...Can we convert it in master theorem format