StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Answers and rating deltas for

What is the asymptotic time-complexity (big theta) of T(n) = log(n*n!)?

Author	Votes	Δ
Leandro Caniglia	0	0.00

Last visited: Jan 11, 2019, 7:17:08 PM