StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How do I find the time complexity T(n) and show that it is tightly bounded (Big Theta)?
| Author | Votes | Δ |
|---|---|---|
| strager | 4 | +1.38 |
| Derek E | 1 | +0.49 |
| Dan Herbert | 0 | -1.44 |
Last visited: Sep 14, 2014, 5:07:29 AM