0 votes 0 votes Let T(n) be a function defined by the recurrence T(n)=2T(n/2)+√n for n≥2 andT(1)=1 Can someone please explain solution of this using back substitution Algorithms algorithms recurrence-relation + – jatin khachane 1 asked Jan 2, 2019 • retagged Jul 9, 2022 by Lakshman Bhaiya jatin khachane 1 360 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Hope it clears your doubt :) (please excuse my untidyness) akshat16 answered Jan 14, 2019 akshat16 comment Share Follow See 1 comment See all 1 1 comment reply akshat16 commented Jan 14, 2019 reply Follow Share Also You can do directly by using master theorem in the form aT(n/b)+O(n^.5) here a=2,b=2,k=0.5 by the formula if a>b^k, T(n)=O(n^logba) b is base, =O(n) 0 votes 0 votes Please log in or register to add a comment.