Programming assignment 2, due 10pm, Wednesday, Jan. 26, 2005.

Making change.

You are to complete the routine make_change() in the file make_change.cc .

This routine takes four integer arguments:

	r = make_change(a, b, c, n)

and should return an integer r such that r is the minimum
number of coins of denominations a, b, and c needed to make
change totaling n.

for example, make_change(1, 5, 8, 10)
should return 2, because with 2 coins (5, 5) of the given
denominations, one can make change totaling 10, and there
is no way to do it with fewer coins of these denominations.
e.g. make_change(1, 5, 8, 17) should return 3 corresponding to (8, 8, 1).

an executable make_change_soln (that runs on eon) is included for you to compare
against.

advice: Before you start coding, design your algorithm.
Try for an algorithm that runs in O(n) time.

files to turn in:

	make_change.cc  (modified to work)
	analysis  --  analysis of your algorithm, see the file for details.