New answers tagged proof-techniques
1
vote
Accepted
Greedy Algorithm and Proof of Correctness for Minimum Denominations of US Coinage System Problem
I decided to write a python script that generates all the optimal solutions for all the change. You can literally scroll through the solutions and observe there are no denomination expansions. So, my ...
1
vote
Greedy Algorithm and Proof of Correctness for Minimum Denominations of US Coinage System Problem
The greedy algorithm is optimal if it only picks 1c coins. It is optimal if it picks a 5c coin as the highest because the alternative is five 1c. It is optimal if it picks one or two 10c because the ...
Top 50 recent answers are included
Related Tags
proof-techniques × 681algorithms × 86
complexity-theory × 76
formal-languages × 73
computability × 47
regular-languages × 47
correctness-proof × 47
induction × 47
turing-machines × 46
graphs × 43
logic × 39
reductions × 38
undecidability × 38
context-free × 37
algorithm-analysis × 35
finite-automata × 33
np-complete × 31
asymptotics × 31
recurrence-relation × 28
automata × 27
pumping-lemma × 23
formal-grammars × 19
recursion × 15
greedy-algorithms × 15
time-complexity × 14