1 votes 1 votes Solve 1) T(n) = 8T(n/2) + n2 a)T(n)= O(n3) True or False ? b)T(n)=O(2n) True or False ? Algorithms algorithms time-complexity asymptotic-notation recurrence-relation + – LavTheRawkstar asked Jan 30, 2017 • retagged Jun 4, 2017 by Arjun LavTheRawkstar 802 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes both true..... soln is theta of n^3 and we know that n^3 =O(2^n) hence for both a and b its TRUE! Smriti012 answered Jan 30, 2017 Smriti012 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Smriti012 commented Feb 1, 2017 reply Follow Share As per my understanding!.... by masters theorem we get T(n)=theta (n3) not Big-OH(n3) since poynomial function< exponential function hence n3=O(2n).. is true thats why both option is TRUE. 1 votes 1 votes LavTheRawkstar commented Feb 1, 2017 reply Follow Share dear mam f(n) is n^2 ie n square 0 votes 0 votes Smriti012 commented Feb 1, 2017 reply Follow Share I am unable to get what u want to ask! I know f(n) is n2 Plz! Explain clearly.. 0 votes 0 votes Please log in or register to add a comment.