StackRating

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

gue

Rating
1524.65 (24,367th) 		Reputation
1,103 (142,472nd)
Page: 1 2
Title Δ
4 values in an array with sum = x 0.00
if values existes from given list in multiple column and counts the... +6.44
Finding big O recursion 0.00
The running time complexity of BFS for unconnected and indirected g... +0.22
Obtaining the intersection points of two circles in CGAL 0.00
Maximum number of non-intersecting edges 0.00
What is the minimum depth / base depth of a recursive function, 0 o... 0.00
Code to triangulate a set of 2d points 0.00
How does one prove an upper/lower bound of a parallel algorithm? 0.00
When should i do Edge Flip in this case ? (For Delaunay Triangulati... -0.21
Is there any algorithm for covering a concave polygon(contains hole... 0.00
Time Complexity of Java PriorityQueue (heap) insertion of n elements? -0.13
Where a vector would intersect the screen if extended towards it... +4.13
Generate Voronoi diagram without using Fortune's algorithm +2.89
finding all independent sets of a perfect graph 0.00
Is it possible to get a slice of an array in constant time? 0.00
Complexity of graph operation algorithm 0.00
Time complexity of program +3.74
Back edges in a graph +3.70
Is n ≠ Θ(logn)? +2.70
solution of recurrence relations of a program 0.00
Tree inside a node in c 0.00
n*n (not nested) for loop complexity 0.00
Representing a graph with an unknown number of nodes? -1.60
Big-O complexity for n + n-1 + n-2 + n-3 + (...) + 1 0.00
I have an array of few repetitive elements, I want to find the inde... 0.00
Is there a way to store a full binary tree in an array and traverse... -0.24
I have a point cloud with 4 points (a Polygon, all points in the sa... +3.45
c++ error : Segmentation fault (core dumped) 0.00
What's the recurrence relation of the following algorithm? 0.00
Qt decompose polygon to smaller polygons 0.00
For undirected graph, why memory requirement for adjacency list rep... 0.00
How to give a recursive algorithm 0.00
Adding points to Voronoi Diagram in d3 0.00
How to convert edge list to DCEL 0.00
STL: sorting and searching in enormous data 0.00
Efficient algorithm for finding closest point in a finite set to an... +1.41
Analysis of 3 power n and 3 power (n+1) 0.00
Performance of Bentley-Ottman versus naive cross-product intersecti... 0.00
What is true when Big O is of another function 0.00
Order of growth of the following expressions: 0.00
Recurrence function's runtime 0.00
Speed up intersection processing on collection of 3D lines 0.00
Master Theorem,Solving the recurrence , T(n)=3T(n/2)+nlogn 0.00
forbidden paths in a graph 0.00
Recurrence: T(n)=T(n/2)+ log N +0.08
Does the polygon intersection code in CGAL always use GMP's rat... 0.00
Is there a Python library to do constrained triangulations in 3D? 0.00
Multiple convex polygon intersection 0.00
Minimum number of squares required to cover a rectangular grid of s... +5.66