StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Why is it assumpted that the time-complexity of multiplication by n is constant?
| Author | Votes | Δ |
|---|---|---|
| Paul Hankin | 4 | 0.00 |
Last visited: Feb 19, 2019, 8:26:47 AM