StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
What is the time complexity of a recursive algorithm given by the recurrence T(n) = 2T(n-1) + 1
| Author | Votes | Δ |
|---|---|---|
| amit | 3 | 0.00 |
Last visited: Sep 5, 2020, 12:36:14 PM