StackRating

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

templatetypedef

Rating
1691.92 (187th) 		Reputation
276,765 (139th)
Page: 1 ... 30 31 32 33 34 ... 81
Title Δ
What is the advantage of generalized suffix tree over prefix tree? 0.00
What is the largest chromatic number of a binary tree? 0.00
Radix Sort - O(n) Time 0.00
Ternary search is worse than binary search? 0.00
Quadratic probing doesn't hit all elements in prime numbered hash t... 0.00
else without previous if error in c++ -0.85
rankOf operation in Sequence ADT 0.00
What do the numbers in square brackets mean beside the TAoCP exerci... +0.20
Time complexity of String matching and Integer Matching 0.00
Why horn formulas algorithm is greedy? 0.00
Why is deciding NP deterministically exponential time 0.00
Why make a class create an instance of itself? +0.20
What is "m" in R-Tree height equation? -0.29
Why is the sizeof() this struct 8? -0.79
Why is constant always dropped from big O analysis? +0.19
Importance of "this" +0.68
Struct member cannot be resolved in c +0.93
Tree with exponential split factor 0.00
advice on how to make my algorithm faster +0.49
Usage, pros and cons for binary search tree, 2-3 tree and B-tree 0.00
Iterative logarithmic exponentiation 0.00
Would Java indexOf (brute force method) be more practical for me or... +0.66
Finding time complexity using recurrence relations +0.72
"|=" what does this mean and what is this called? (c++) +0.52
Are there any modern garbage collections based on two-space/Cheney'... 0.00
Recurrence relations and asymptotic complexity 0.00
Super keyword in Java, interesting behavior, please explain +0.55
When are simple sorts faster than 'complex' sorts? +0.18
How to solve the recursive complexity T(n) = T(n/4)+T(3n/4)+cn -0.30
deciding whether the grammar is LR(0) or not +0.20
Explanation and time/space complexity of tri tiling 0.00
Finding a minimum spanning tree on a directed graph 0.00
Using the geometric series to work out big o notation for resizing... 0.00
How do I check whether all code paths return a value 0.00
method for substituting the variable in a recurrence relation 0.00
Recursion Trees and Asymptotic Complexity 0.00
Why are skip lists not preferred over B+-trees for databases? 0.00
Is there a way to make `something;` do anything? 0.00
Can I say that a Θ(n^3/2)-time algorithm is asymptotically slower t... +0.77
Generate directed network with two separate degrees 0.00
Does comparison really take O(1) time? and if not... why do we use... 0.00
Scenarios for selection sort, insertion sort, and quick sort 0.00
Polynomial time: Accepting and Decision Algorithms 0.00
Given a sorted array of n elements, sort a subset n/2 elements in l... +0.21
Get the running time T(n) 0.00
longest nondecreasing subsequence in O(nlgn) -0.79
Can an LL(1) grammar have multiple rules that begin with the same n... +0.20
LightsOut game solving method "reduced echolean ".Does it... 0.00
A* graph algorithm giving incorrect output 0.00
How to find the number of edges or vertices between any two vertice... -1.38