StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
If algorithm time complexity is theta(n^2), is it possible that for one input it will run in O(n)?
| Author | Votes | Δ |
|---|---|---|
| sve | 1 | +3.07 |
| templatetypedef | 1 | -0.04 |
| coneyhelixlake | 0 | -2.73 |
Last visited: Sep 14, 2014, 5:07:29 AM