StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How to solve this recursion equation T (n) = √2T(n/2) + log n using master theorem?
| Author | Votes | Δ |
|---|---|---|
| ralf htp | 0 | -0.26 |
| Salvador Dali | 0 | +0.03 |
Last visited: Apr 22, 2016, 3:43:18 AM