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 ... 33 34 35 36 37 ... 81

Title	Δ
Does Dijkstra's algorithm apply even if there is only one negative...	-0.52
Why must delete[] and delete be different?	+1.26
How are differences in primitive types expressed during memory comp...	-0.29
Prove that all non-recursive languages are infinite	0.00
NP problems can be solved in deterministically EXPONENTIAL time?	0.00
Would an exponential lower bound on an NP-complete language prove P...	0.00
Height of a red black tree	0.00
How do I prove a DFA has no synchronizing word?	0.00
Computing the load factor in a hash table that coalesces duplicates?	0.00
How do you use a binary heap to implement a priority queue?	0.00
What does P(Σ∗) mean in complexity theory?	0.00
Time complexity of deleting a leaf from a binary heap	0.00
This is a C program to calculate summation of k from 0 to n : nCk ....	+0.21
std::shared_ptr deep copy object	0.00
How do i pass STL set as function parameters	-0.77
Sorting m sets of total O(n) elements in O(n)	0.00
which graph analysis is dependent to the connected components of a...	-1.17
How come my program keeps crashing when I try to run it?	-0.15
Applications of a circular shift	+1.21
Algorithm to find if location (latitude , longitude) is within radi...	-3.15
Finding max depth of binary tree without recursion	-1.23
What is the average time complexity of Bogosort?	0.00
Does a C++ destructor always or only sometimes call data member des...	+0.80
Dependence of complexity of graph algorithms on weight of edges?	0.00
Weird automatic by-ref'ing in C++	+0.21
Why don't hardware failures show up at the programming language lev...	-0.17
Why does A* run faster than Dijkstra's algorithm?	+0.19
Algorithm for computing first and follow set in grammar	0.00
Finding the left-most child for every node in a tree in linear time?	+0.19
Find the computational complexity for the following loops	0.00
Efficient implementation of a "constant" Set ADT	+1.38
Bitwise structure programming in C	+0.21
Why is the space complexity of this algorithm O(n)?	0.00
Obtaining time complexities by simplifying the denominator?	-0.30
What prevents the callee from cleaning up the stack?	+0.87
Data structure supporting O(1) remove/insert/findOldest?	0.00
Lights out game algorithm	+0.54
A[j] = 2∗A[i] in list with better than O(n^2) runtime	+1.03
Why are there two listed time complexities for breadth-first search?	0.00
Is this web crawler doing a breadth-first search or a depth-first s...	0.00
How to quickly compute 2^x?	+0.22
Must an AVL tree satisfy the characteristics of a BST to be conside...	0.00
Compiler error with template member function	0.00
Karatsuba Algorithm in Big O n^(lg3) proof by substitution	0.00
Can an element x, be found in a sorted array of size n using n Comm...	0.00
Using BFS or DFS to determine the connectivity in a non connected g...	-0.70
Complexity of balancing an unbalanced/partially balanced BST?	0.00
Analyzing function runtime complexity	-0.81
Counting the sum of every nodes' neighbors' degrees?	0.00
Sudoku generator algorithm optimization welcome	0.00