StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Find the time complexity of the function t[n] == 3 t[n/2] + 4 n^2
| Author | Votes | Δ |
|---|---|---|
| leonardo12 | 0 | 0.00 |
Last visited: Mar 18, 2018, 5:39:47 PM