StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Can an O(n) algorithm ever exceed O(n^2) in terms of computation time?
| Author | Votes | Δ |
|---|---|---|
| Dukeling | 90 | +0.85 |
| Nikunj Banka | 17 | +2.88 |
| hivert | 14 | +0.22 |
| Save | 4 | -1.06 |
| Søren Debois | 3 | -2.74 |
| peterh | 3 | -0.79 |
Last visited: Sep 14, 2014, 5:07:29 AM