StackRating

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

Jordi Vermeulen

Rating
1524.68 (24,311th) 		Reputation
952 (161,233rd)
Page: 1 2
Title Δ
Kruskals Algorithm explained 0.00
Disjoint Set in a special ways? 0.00
Skip List: Insertions 0.00
Why wrap around is necessary for queue but not for stack? 0.00
Solving the Recurrence Relation T(n)=T(n-1)*T(n-2)+c where T(0)=1 a... +4.27
Why k-d trees is not used for high dimensional data? 0.00
Android path seeking algorithm -0.24
which is the best algorithm(time complexity) to find the shortest p... 0.00
Application works in cmd, gives segfault in git bash 0.00
Skyline of Buildings +0.37
How to optimize solution to the 0/1 knapsack? 0.00
StackQueue Amortized Time Implementation 0.00
Diagonal Sudoku 0.00
store $key as array weird result 0.00
Adding Values with int.parse +3.74
In BST, which traversal is required to visit all keys in decreasing... +3.85
Determining number of calls (activations) to mergesort +4.07
How to prove that Fractional Knapsack exhibits Greedy Strategy.? +5.14
Time complexity of double invarient for loops +2.35
refine merge-sort to count number of inversions 0.00
Radix sort explanation 0.00
Suitor elimination +3.81
Questions about using a Radix Tree in android for English dictionar... 0.00
Intersection of a line in 3D and polygonal mesh 0.00
create a BST of string . error 0.00
Knapsack - determining set from total value 0.00
How to count the number of arrays comparisions that occurred during... 0.00
FFT reordering phase -4.07
Memory complexity of Quicksort +4.86
Understanding the percolate up and down functions in Heaps (Priorit... 0.00
Is range tree widely used in spacial search problems? +4.16
handling arrays in class declaration -4.25
Search operation complexity -2.06
In search of the proper Union DST with inverse-ackermann complexity -3.39
Binary Search Tree Explanation 0.00
Tarjan Algorithm for SCC worst case analysis 0.00
RB tree with sum +4.02
how to check if a given spanning tree is the MST 0.00
What's a more efficient way to make sure I'm not stuck in a... 0.00
Dynamic programming: Balanced Partition 0.00
replace words /strings by bold word/string -0.08
3D Convex Hull's Volume +0.00
Finding max flow between two nodes on graph -0.05
Is there any difference between these two functions in regard to ef... +5.12
Optimizing a Ray Tracer -0.24
Binary Search Tree preorder traversal, recursion vs loop? -4.11
Breadth First Search Not Working 0.00
How come this linked list isn't working? -2.22
Is Dilation/Erosion with fixed kernel for a number of iterations is... -4.30
CRC algorithm resulting into values of less than 16 bit 0.00