The Gateway to Computer Science Excellence
0 votes
14 views
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n) =2T(n-1) + 1$.Use the substitution method to verify your answer.
in Algorithms by | 14 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,375 questions
60,554 answers
201,952 comments
95,375 users