0 votes 0 votes Algorithms recurrence-relation + – Sanjay Sharma asked May 26, 2016 retagged Jun 24, 2022 by Lakshman Bhaiya Sanjay Sharma 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Simply Solve Using Master Theorem T(n)=O(nlog2 M) Here time complexity depends on value M although we n2 here. Suppose M=8 T(n)=O(n3) ManojK answered May 26, 2016 selected May 26, 2016 by Sanjay Sharma ManojK comment Share Follow See all 3 Comments See all 3 3 Comments reply Sanjay Sharma commented May 26, 2016 reply Follow Share choices are (A) O(n^2) (B) O(n^lgm) (C) O(n^2 lg n) (D) O(nlgn) 0 votes 0 votes shivanisrivarshini commented May 26, 2016 reply Follow Share Suppose M=4 then O(n2) 0 votes 0 votes ManojK commented May 26, 2016 reply Follow Share then its O(n2 logn) but we can predict what M is So its T(n)=O(nlog2 M) 0 votes 0 votes Please log in or register to add a comment.