A Akanksha Bhardwaj @akanksha13 added a Question 18 Jul 2017 Find the time complexity of this code snippet. 2Comments thumbs up down up1 liked Parth Sharma @parthsharmau 18 Jul 2017 11:25 am T (n)=T (n/2) + T (n/2) + c C time for that addition and 2 multipliactions and 2 recursive calls are there of half size I hope we can solve that easily up0 like Log in or register to post comments shivani @shivani1234 21 Jul 2017 04:14 pm the recursive equation can be written as A(n)=8A(n/2)+ n^{2} Apply master theorem , then case -> a>b^{k } then ans is O(n^{3}) up2 liked Log in or register to post comments

T (n)=T (n/2) + T (n/2) + c

C time for that addition and 2 multipliactions and 2 recursive calls are there of half size

I hope we can solve that easily

the recursive equation can be written as A(n)=8A(n/2)+ n

^{2}Apply master theorem , then case -> a>b

^{k }then ans is O(n

^{3})