StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POHow to find all matching numbers, that sums to 'N' in a given array
text
Body
copied!<p>My goal here is to find all possible combinations that sums to a given total. For example, if the array is 2 59 3 43 5 9 8 62 10 4 and if the total is 12, then possible combinations are</p> <pre><code>2 10 3 9 8 4 5 3 4 </code></pre> <p>Here is the first set of code, that I've written. Wondering the best improvements that can be done on this.</p> <pre><code> int find_numbers_matching_sum(int *number_coll, int total) { int *search_till = lower_bound(number_coll,number_coll+TOTAL_SIZE, total); int location = search_till - number_coll; if (*search_till > total && location > 0 ) { --location; } while ( location >= 0 ) { find_totals(number_coll,total,location); --location; } return 1; } int find_totals(int *number_coll, int total, int end_location) { int left_ones = total - number_coll[end_location]; int curloc = end_location; int *search_till = 0; int location ; int all_numbers[10]; int i = 0; all_numbers[i] = number_coll[end_location]; while ( left_ones && curloc >= 0 ) { search_till = lower_bound(number_coll,number_coll+end_location, left_ones); location = search_till - number_coll; if (*search_till > left_ones && location > 0 ) { --location; } else if ( left_ones < *search_till ) { break; } curloc=location; left_ones = left_ones - number_coll[curloc]; all_numbers[++i] = number_coll[curloc]; end_location = curloc - 1; } if ( !left_ones ) { while ( i>=0) { cout << all_numbers[i--] << ' '; } } cout << endl; return 1; } </code></pre>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

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