StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
What is the big O notation complexity of an algorithm with T(N) = 16N+8N^2+N^2log(n)+6NK+5N^2K-5NK^2
| Author | Votes | Δ |
|---|---|---|
| jofel | 1 | +3.83 |
| Ankit Shubham | 0 | -3.83 |
Last visited: Apr 22, 2016, 3:43:18 AM