StackRating
An Elo-based rating system for Stack Overflow
Home
|
About
|
Stats and Analysis
|
Get a Badge
Answers and rating deltas for
How to show that the time complexity of algorithm is O(2^n)?
Author
Votes
Δ
sivi
1
+0.18
gen-y-s
1
-0.18
Last visited: Nov 20, 2015, 4:01:28 AM