Suppose we wanted to make change for purchases and wanted to use the least number of coins possible. Here is a greedy algorithm:
1 answer:
Answer:
Explanation:
The following code is a Python function that takes in the amount of change. Then it uses division and the modulo operator to calculate the number of coins that make up the changes, using the greatest coin values first.
import math
def amountOfCoins(change):
print("Change: " + str(change))
quarters = math.floor(change / 0.25)
change = change % 0.25
dimes = math.floor(change / 0.20)
change = change % 0.20
pennies = math.floor(change / 0.01)
print("Quarters: " + str(quarters) + "\nDimes: " + str(dimes) + "\nPennies: " + str(pennies))
You might be interested in
Answer:
The program to this question can be described as follows:
Program:
#include <iostream> //defining header file
using namespace std;
int main() //defining main method
{
int x; //defining integer variable
for(x=0;x<=100;x++) //defining loop to count value from 0 to 100
{
if(x%7==0) //check value is divisable by 7
{
cout<<x<<endl; //print value
}
}
return 0;
}
Output:
please find the attachment.
Explanation:
In the above code, an integer variable x is declared, which is used in the for loop, in this loop variable "x" starts from 0 and ends when the value of x is less than and equal to 100.
- Inside the loop an, if block is used that defines a condition that is (i%7==0), it will check, that the value is divided by 7.
- In this loop, a print method is used, that prints its values.
