Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with greedy
Search options not deleted
user 14027
greedy.c, one of the assignments in Problem Set 1, asks you to develop a "greedy algorithm" to calculate the minimum number of coins needed to make change, while demonstrating an understanding of floating point number storage in a computer.
1
vote
1
answer
71
views
Problem set 1 Greedy My code is wrong... Way?
");
f = (100*get_float());
y = round(f);
}
while ( f < 0 );
// count greedy
int amount = y;
int coin[] = {25,10,5,1};
int num; …
