StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Using recurrence tree, solve the recurrence T(n) = T(n − 1) + O(n)
| Author | Votes | Δ |
|---|---|---|
| trincot | 1 | 0.00 |
Last visited: Nov 27, 2022, 9:27:33 PM