Change-Making Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:2610:26, 15 February 2023Admin talk contribs 1,384 bytes +1,384 Created page with "{{DISPLAYTITLE:Change-Making Problem (Change-Making Problem)}} == Description == Given an unlimited amount of coins of denominations $c_1, \ldots, c_n$, and a desired sum $S$, find the minimum number of coins necessary to make $S$. == Parameters == <pre>n: number of coin denominations S: sum to be made</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !!..."