2 votes 2 votes Kindly help in solving the following recurrence relation. Solution is given by using Master's Theorem but can it be applied when the parameter 'b' is not an integer? IF not, then how to solve it? options are O(n), O(n^2), O(nlogn), O(n^2 logn) Algorithms algorithms recurrence-relation made-easy-test-series + – Subham Nagar asked Jan 26, 2018 • edited Mar 4, 2019 by ajaysoni1924 Subham Nagar 390 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply sumit goyal 1 commented Jan 26, 2018 reply Follow Share answer will be O$(n^2)$ by using masters theorem we can apply masters theorem 1 votes 1 votes Mk Utkarsh commented Jan 26, 2018 reply Follow Share $n^{log_{\sqrt{2}}2}$ = $\Theta (n^{2})$ 0 votes 0 votes sumit chakraborty commented Jan 26, 2018 reply Follow Share Master's theorem can be applied here to get the answer $\Theta (n^{2})$ by the formula pointed out by @Mk Utkarsh. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes master theorem is not applicable. here a is not a => 1. abhishekmehta4u answered Apr 27, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.