StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Answers and rating deltas for

Solving the recurrence T(n) = T(n/3) + O(logn) + n by giving a tight bound

Author Votes Δ
David Eisenstat 1 0.00
Last visited: May 11, 2019, 11:16:05 PM