StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How can i solve the following recurrence, T(n) = 1 if n = 1, otherwise T(n) = 2T(n/2) + logn ,exactl
| Author | Votes | Δ |
|---|---|---|
| 夢のの夢 | -1 | -1.45 |
| Sandipan Dey | -1 | +0.18 |
Last visited: Jun 24, 2017, 4:03:14 PM