Olórin's user avatar
Olórin's user avatar
Olórin's user avatar
Olórin
  • Member for 9 years, 5 months
  • Last seen more than 3 years ago
  • Folsom Prison, Folsom, CA, USA
16 votes
4 answers
30k views

Is there a difference between perfect, full and complete tree?

9 votes
3 answers
7k views

Is the height of the tree the number of edges or number of nodes?

5 votes
2 answers
890 views

Do all greedy algorithm produce just the first solution, no matter how bad it is?

4 votes
2 answers
2k views

Greedy proof: Correctness versus optimality

4 votes
2 answers
1k views

What's the big deal with the knapsack problem?

4 votes
3 answers
8k views

When inserting into a binary tree, is there a universal agreed upon place to insert then new node to minimize complexity?

4 votes
2 answers
3k views

Does amortized complexity always equal to worst case complexity divided by n?

3 votes
2 answers
447 views

Can someone provide a trivial example to the "reduction" procedure used to prove hardness? [duplicate]

3 votes
1 answer
405 views

Can anyone explain why this is an inadmissible recurrence case that cannot be solved by the master theorem?

2 votes
1 answer
171 views

Reference request: Introduction to reinforcement learning with hand calculation examples

2 votes
2 answers
14k views

What is the complexity of recurrence $T(n) = T(n-1) + 1/n$ [duplicate]

1 vote
1 answer
104 views

Does big-Oh notation in optimization follow the same convention as in CS?

1 vote
2 answers
205 views

Calculating the number of unique BST generatable from n keys, why is my number so large

1 vote
1 answer
63 views

Is Binary Search Related to Binary Search Tree? [closed]

1 vote
1 answer
168 views

Wouldn't a Red-Black tree fix up after insertion mess up the BST ordering?

1 vote
2 answers
4k views

How can I use the NP complexity Venn diagram to quickly see which class of NP problem can be poly reducible to another class?

1 vote
2 answers
58 views

Can't see how this can be true: any connected undirected graph $G$ contains vertex v such that removing v results in another connected Graph $G'$ [closed]

1 vote
0 answers
639 views

What needs to be done after deleting an item in a hash table built under opening addressing with linear probing

1 vote
1 answer
1k views

Are all adjacency matrices represented by 0 and 1s? [closed]

0 votes
1 answer
656 views

Modified Bellman Ford to find minmum cost cycle in O(E²V) time?

0 votes
1 answer
119 views

What will trigger a worst time search for a binary heap and what is the run time? [closed]

0 votes
1 answer
5k views

Why can the alphabet be represented in numbers in base 256

0 votes
1 answer
594 views

If A is polynomial time reducible to B such that B <= A, does it mean B must be a polynomial time algorithm?

-1 votes
1 answer
666 views

How do you show that repeatedly dividing $n$ by $2$ takes $\log_2n$ steps to reach $1$?