change_greedy, a Python code which uses the greedy method to seek a solution to the change making problem, which tries to match a given amount by selecting coins of various denominations.
If there is a coin of value 1, then there is always at least one solution to the change making problem.
If the coin denominations are ``canonical'', then the greedy method is always guaranteed to come up with a solution, and this solution will involve the fewest possible number of coins.
If the coin denominations are not canonical, then the greedy method may return a solution which does not use the minimum number of coins, or it may fail to find a correct solution at all.
The computer code and data files described and made available on this web page are distributed under the MIT license
change_greedy is available in a MATLAB version and a Python version.
change_dynamic, a Python code which uses dynamic programming to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.
combo, a Python code which includes many combinatorial routines.
football_dynamic, a Python code which uses dynamic programming to count the ways of achieving a given score in football.
mcnuggets, a Python code which counts M(N), the number of ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.
partition_brute, a Python code which uses brute force to seek solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
partition_greedy, a Python code which uses a greedy algorithm to seek a solution of the partition problem, in which a given set of integers is to be split into two groups whose sums are as close as possible.
satisfy, a Python code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
subset, a Python code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.
subset_sum, a Python code which seeks solutions of the subset sum problem, in which it is desired to find a subset of a set of integers which has a given sum.
tsp_brute, a Python code which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.
tsp_greedy, a Python code which reads a file of city-to-city distances and solves the traveling salesperson problem, using a greedy algorithm.