StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Proving this recursive Fibonacci implementation runs in time O(2^n)?
| Author | Votes | Δ |
|---|---|---|
| templatetypedef | 4 | +0.46 |
| Ibrahim Amer | 0 | -0.44 |
| Utkash Dubey | 0 | -0.44 |
| mrip | 0 | -0.35 |
Last visited: Sep 14, 2014, 5:07:29 AM