StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Why doesn't Bead Sort have a theoretical time complexity of O(n)?
| Author | Votes | Δ |
|---|---|---|
| Am_I_Helpful | 1 | +0.55 |
| user2357112 | 1 | -0.55 |
Last visited: Aug 26, 2016, 2:34:25 PM