Databases
StackOverflow2013
Postsdbo
POWhat is a good non-recursive algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POWhat is a good non-recursive algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
    primarykey
    data
    text
    <p>What is a <strong>non recursive</strong> algorithm for deciding whether a passed in amount can be built additively from a set of numbers.<br> In my case I'm determining whether a certain currency amount (such as $40) can be met by adding up some combination of a set of bills (such as $5, $10 and $20 bills). That is a simple example, but the algorithm needs to work for any currency set (some currencies use funky bill amounts and some bills may not be available at a given time).<br> So $50 can be met with a set of ($20 and $30), but cannot be met with a set of ($20 and $40). The non-recursive requirement is due to the target code base being for <code>SQL Server 2000</code> where the support of recursion is limited.<br> In addition this is for supporting a multi currency environment where the set of bills available may change (think a foreign currency exchange teller for example).</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USBlachshma
    1. USStimy
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POWhat is a good non-recursive algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
      1. This table or related slice is empty.
      1. VTDownMod
    2. VO
      singulars
      1. POWhat is a good non-recursive algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POWhat is a good non-recursive algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
      1. This table or related slice is empty.
      1. VTDownMod
    1. This table or related slice is empty.
 

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