StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How to solve the recurrence T(n) = 2T(n^(1/2)) + log n?
| Author | Votes | Δ |
|---|---|---|
| templatetypedef | 1 | 0.00 |
| 0x90 | 0 | +0.42 |
| Serge | 0 | -0.42 |
Last visited: Sep 14, 2014, 5:07:29 AM