1 votes 1 votes Which of the following theorems can solve all Recurrence Relations? Mater Tehorem Akra-Bazzi Theorem Both [A] and [B] Akra-Bazzi can be applied to some cases but not for all. Algorithms tbb-algorithms-2 + – Bikram asked May 26, 2017 edited Aug 20, 2019 by Counsellor Bikram 444 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ejaz Ali commented Oct 15, 2017 reply Follow Share https://en.m.wikipedia.org/wiki/Akra–Bazzi_method As per this Area Bazzi is just a generalisation of Master Theorem. So Master Theorem should be no lesser powerful then Akra Bazzi. ? Please clarify. 0 votes 0 votes Satyajeet Singh commented Jan 6, 2018 reply Follow Share As per the wiki In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear in the analysis of divide and conquer algorithms where the sub-problems have substantially different sizes. It is a generalization of the master theorem for divide-and-conquer recurrences, which assumes that the sub-problems have equal size. As per the paragraph above , Master theroem is applicable only on recurrence relation that deal with same size subproblem.. However Akra-bazzi can solve all recurrence relations (of equal or unequal subproblems) 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Akra bazzi is the answer. As master theorem can not be applied everywhere Bikram answered May 26, 2017 selected Aug 20, 2019 by Bikram Bikram comment Share Follow See 1 comment See all 1 1 comment reply ajay10 commented Dec 29, 2018 reply Follow Share I am not able to understand that how you are able to generalize that akra-bazi is applicable for all recurrence relations. there are some set of conditions ,and if it follows all of them , then only akra- bazi will be applicable . why we are not taking those conditions in consideration.? 3 votes 3 votes Please log in or register to add a comment.
1 votes 1 votes Akra-Bazzi method isn't applicable to recurrences that don't involve divide and conquer. I think Option D is more appropriate. JashanArora answered Dec 30, 2019 JashanArora comment Share Follow See all 0 reply Please log in or register to add a comment.