StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Why is the complexity of computing the Fibonacci series 2^n and not n^2?
| Author | Votes | Δ |
|---|---|---|
| amit | 13 | +1.94 |
| templatetypedef | 3 | -0.81 |
| jason | 3 | -0.84 |
| Zhongyuan | 1 | -2.31 |
Last visited: Sep 14, 2014, 5:07:29 AM