209 views
1 votes
1 votes

what if some recurrence relation is not solvable by master theorem   we should apply 1)recursion method or  2)substitution mnethod which is easier and accurate  e.g   if s is replaced by 5 in following question

solve 

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
3
0 votes
0 votes
2 answers
4
Mak Indus asked Nov 10, 2018
254 views
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ...