StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
What is the time complexity of the recurrence T(n) = 2T(n-1) + 4
| Author | Votes | Δ |
|---|---|---|
| hivert | 3 | +1.64 |
| Mohamed Ennahdi El Idrissi | 0 | -1.64 |
Last visited: Sep 14, 2014, 5:07:29 AM