StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Proving Order of complexity proofs if f(n) is Ω(n∗g(n)), then f(n) is not O(g(n))
| Author | Votes | Δ |
|---|---|---|
| Mo B. | 1 | 0.00 |
Last visited: Nov 27, 2022, 9:27:33 PM