StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Can I say that a Θ(n^3/2)-time algorithm is asymptotically slower than an Θ(n log n)-time algorithm?
| Author | Votes | Δ |
|---|---|---|
| templatetypedef | 2 | +0.77 |
| Erik A. Brandstadmoen | 1 | -0.77 |
Last visited: Sep 14, 2014, 5:07:29 AM