StackRating

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

gartenkralle

Rating
1488.65 (4,435,165th) 		Reputation
211 (455,802nd)
Page: 1
Title Δ
Always O(1) is better than O(n) in algorithm time complexity? -2.21
Complexity for set +4.09
How to improve my algorithm time complexity? -4.13
What is better sorting an unsorted array and binary searching n tim... 0.00
How to link ssh with cmake on ubuntu? 0.00
How to debug MIT-DLEP source? 0.00
Unable to locate the element using id/name/xpath/CSSSelector +0.06
Automation tool for Angular Application? -4.08
Using Selenium Webdriver gives login details Incorrect even though... 0.00
Dcucumber.options, run a single cucumber test +0.06
What is the time complexity of the following nested loop dependency? -3.12
Best case time complexity for selection sort 0.00
Algorithm Complexity-Nested For Loops 0.00
What is the complexity of code that does O(n*log n) work, and then... -2.23
Analyzing the time complexity of this function +4.04
How to extract exact information from website using C#? -4.03
How to remove common objects from two lists with linq +4.37
How to getResourceAsStream of a file of a jar -4.19