StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

AbcAeffchen

Rating
1499.41 (3,784,562nd)

Reputation
8,705 (17,926th)

Page: 1 2 3 4 ... 5

Title	Δ
Worst-Case Runtime Recurrence: Data Structure and Big-O Analysis	0.00
Recursion's big O	-0.02
Don't really understand the notation	0.00
Big-Oh notation for if else loops	-0.02
Trying to show number of recursive calls for fibonacci is equal to...	0.00
NTL Library: How to assign a big integer to ZZ_p	0.00
can someone please help me with my first php contact	+0.52
PDO - SQL COUNT not working in PHP function	0.00
Big-O and Function Domination	0.00
How does PDO::prepare() generates a PDOStatement object?	-1.77
how get last inserted id in multiple record insert?	0.00
Big O Notation with Absolute Value?	-0.51
PHP mysqli query issue when running multiple queries inside while l...	0.00
Using named parametes multiple times vs. returned datatypes in PDO	0.00
Calculating the Recurrence Relation T(n)=T(n / log n) + Θ(1)	+1.26
MYSQL comparing time and day of week simultaneously	0.00
MySQL relationships vs performance	0.00
Given a time complexity, how do you calculate run time given an n?	0.00
MySQL Friend Table Two-Way Unique Index	0.00
PHP - position in table	-0.07
Inserting data while iterating over a result set using prepared sta...	0.00
Inserting record if the ID is not in the database and update it els...	+0.50
Why, algorithm and data structure, both are not considered together...	-0.48
time complexity of non-inplace binary search	+0.48
Time complexity of python code for finding the longest word that ca...	0.00
Time complexity of Boggle solver	0.00
How to calculate the T(N) for this primes finder algorithm	0.00
Most Frequent Digit In a Specific Range	0.00
Complexity of Fermat's Little Theorem	0.00
Worst case runtime for "Find the element repeated more than n/...	-0.81
algorithm proof - building least number after deleting k digits fro...	-0.17
Big O Notation analysis using recursion tree	0.00
What is the possible tree diagram for O(n²) time complexity?	0.00
Quicksort vs Mergesort on big arrray with a high range of values	0.00
How to calculate Best case time complexity	0.00
How do you show that a language is in the class P?	-0.02
What is the time complexity of this for loop?	0.00
Really confused about Time Complexities	-0.01
Prove that log₂(n) is O(n)	0.00
Is "best case performance Θ(1) -> running time ≠ Θ(log n)&q...	-0.02
How can I express this in Big O notation?	0.00
Big O notation: O((n-1)!) or O(n!) for T((n-1)!)?	+0.47
What are "relevant operations" in analysis of algorithms?	0.00
How to compare exponential complexities?	+0.49
concerning big-oh notation and proving or disproving	0.00
Comparing complexities	0.00
f(n)/log(n) = O(g(n)) ⇒ g(n) = Θ(f(n))?	-0.54
Find unqiue sets of size r from a set of n elements with only 1 siz...	+0.48
Shortest paths that are impossible for BFS to find?	0.00
How can i find a running time of a recurrence relation?	0.00