StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Prove the number of binomial trees in a binomial heap with n elements is at most O(log n)
| Author | Votes | Δ |
|---|---|---|
| user2566092 | 1 | 0.00 |
Last visited: Sep 14, 2014, 5:07:29 AM