Databases
StackOverflow2013
Postsdbo
POI'm coding a brute-force algorithm on change making and I'm a little stuck
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POI'm coding a brute-force algorithm on change making and I'm a little stuck
    primarykey
    data
    text
    <p>I need to write a program that uses brute-force method to find out how to make change the most efficiently. I'm a little confused and I'm curious if I'm on the right track. I'm writing it in C.</p> <p>It does not use a greedy algorithm.</p> <p>It's just confusing me is all. In the end it should output the most efficient change as toonie, loonie, quarter, dimes, nickels, pennies, in that order. (Like 1 1 0 0 1 0.)</p> <p>Am I on the right track? I'm a little confused as to what I'm doing, six for loops is apparently the key, and I'm adding each iteration, but as to what's going on conceptually I'm a little confused.</p> <pre><code>#include &lt;stdio.h&gt; int main(int argc, char *argv[]) { //Input int amount = 336; int bestSolution = amount; //Coins int toonies = 0, loonies = 0, quarters = 0, dimes = 0, nickels = 0, pennies = 0; int amountAfterToonies, amountAfterLoonies, amountAfterQuarters, amountAfterDimes, amountAfterNickels; //Counters int i, j, k, l, m, n; for (i = 0; i &lt; amount / 200; i++) { //Finds amount toonies++; amountAfterToonies = amount % 200; for (j = 0; j &lt; amountAfterToonies / 100; j++) { loonies++; amountAfterLoonies = amountAfterToonies % 100; for (k = 0; k &lt; amountAfterLoonies / 25; k++) { quarters++; amountAfterQuarters = amountAfterLoonies % 25; for (l = 0; l &lt; amountAfterQuarters / 10; l++) { dimes++; amountAfterDimes = amountAfterQuarters % 10; for (m = 0; m &lt; amountAfterDimes / 5; m++) { nickels++; amountAfterNickels = amountAfterDimes % 5; for (n = 0; n &lt; amountAfterNickels; n++) { pennies++; sum = toonies + loonies + quarters + dimes + nickels + pennies; if (sum &lt; bestSolution) { bestSolution = sum; } } } } } } } printf("%d %d %d %d %d %d\n", toonies, loonies, quarters, dimes, nickels, pennies); printf("%d\n", bestSolution); return 0; } </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USsarnold
    1. USDoug Smith
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. COI would recommend reconsidering how you have your for loops set up. In fact, totally reconsider your for loops.. Also, try finding just toonies first, then add in finding loonies and so on.
      singulars
      1. POI'm coding a brute-force algorithm on change making and I'm a little stuck
      1. USJustin Peel
    2. COWhat is your definition of "most efficient" ? This will run through a bunch of options and print them out, but you aren't making a decision anywhere.
      singulars
      1. POI'm coding a brute-force algorithm on change making and I'm a little stuck
      1. USJohn3136
    3. COMost efficient would mean least amount of coins possible. For example, 113 cents would be 1 loonies, a dime and 3 pennies.
      singulars
      1. POI'm coding a brute-force algorithm on change making and I'm a little stuck
      1. USDoug Smith
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload