User Olórin

16 votes

4 answers

30k views

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

asked Oct 28, 2014 at 2:54

9 votes

3 answers

7k views

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

asked Oct 27, 2014 at 1:55

5 votes

2 answers

1k views

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

asked Dec 17, 2014 at 7:36

4 votes

2 answers

3k views

Greedy proof: Correctness versus optimality

asked Dec 18, 2014 at 4:18

4 votes

2 answers

1k views

What's the big deal with the knapsack problem?

asked Nov 7, 2014 at 3:16

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?

asked Dec 16, 2014 at 0:42

4 votes

2 answers

3k views

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

asked Dec 17, 2014 at 1:43

3 votes

2 answers

459 views

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

asked Dec 15, 2014 at 7:23

3 votes

1 answer

406 views

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

asked Oct 28, 2014 at 17:53

2 votes

1 answer

180 views

Reference request: Introduction to reinforcement learning with hand calculation examples

asked Aug 19, 2016 at 20:45

2 votes

2 answers

14k views

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

asked Dec 17, 2014 at 5:30

1 vote

1 answer

106 views

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

asked Jan 20, 2018 at 22:08

1 vote

2 answers

208 views

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

asked Dec 17, 2014 at 8:13

1 vote

1 answer

64 views

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

asked Oct 29, 2014 at 2:25

1 vote

1 answer

173 views

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

asked Oct 28, 2014 at 1:52

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?

asked Dec 16, 2014 at 1:08

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]

asked Dec 16, 2014 at 1:48

1 vote

0 answers

672 views

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

asked Dec 17, 2014 at 2:40

1 vote

1 answer

1k views

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

asked Dec 17, 2014 at 2:51

0 votes

1 answer

662 views

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

asked Dec 17, 2014 at 4:15

0 votes

1 answer

119 views

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

asked Dec 16, 2014 at 0:14

0 votes

1 answer

5k views

Why can the alphabet be represented in numbers in base 256

asked Oct 28, 2014 at 0:39

0 votes

1 answer

606 views

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

asked Dec 15, 2014 at 3:30

-1 votes

1 answer

704 views

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

asked Oct 26, 2014 at 21:23

Stack Exchange Network

24 Questions

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

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

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

Greedy proof: Correctness versus optimality

What's the big deal with the knapsack problem?

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

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

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

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

Reference request: Introduction to reinforcement learning with hand calculation examples

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

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

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

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

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

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

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]

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

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

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

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

Why can the alphabet be represented in numbers in base 256

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

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