13 votes 13 votes Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$ Algorithms gate1988 descriptive algorithms recurrence-relation + – go_editor asked Dec 20, 2016 • recategorized Apr 16, 2021 by Lakshman Bhaiya go_editor 3.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Kiyoshi commented Jun 8, 2021 reply Follow Share Additional information : this is the recurrence relation for binary search. 1 votes 1 votes Please log in or register to add a comment.
–2 votes –2 votes T(n)=T(n2)+1 use master theorem we get answer as logn focus _GATE answered Dec 20, 2016 focus _GATE comment Share Follow See all 0 reply Please log in or register to add a comment.
