0 votes 0 votes find(int n) { if(x<2)return; else for(i =1; i<=4; i++) find (n/2); for(i= 1;i< =n*n; i++) sum=sum+1; } Algorithms algorithms recursion time-complexity + – gshivam63 asked May 21, 2016 • edited Jan 10 by Hira Thakur gshivam63 489 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes Recurrence Relation of above program =4T(n/2)+n2 Now solve using master theorem =O(n2logn) ManojK answered May 21, 2016 • selected May 21, 2016 by gshivam63 ManojK comment Share Follow See all 2 Comments See all 2 2 Comments reply asu commented May 21, 2016 reply Follow Share how can one imagine to form recurrence 0 votes 0 votes ManojK commented May 21, 2016 reply Follow Share By practice 0 votes 0 votes Please log in or register to add a comment.