Question

Use the greedy algorithm to make change using quarters, dimes, nickels, and pennies for.
a) 5100 rupees

Answer 1

Answer:

// C++ program to find minimum

// number of denominations

#include <bits/stdc++.h>

using namespace std;

// All denominations of Indian Currency

int deno[] = { 1, 2, 5, 10, 20,

  50, 100, 500, 1000 };

int n = sizeof(deno) / sizeof(deno[0]);

void findMin(int V)

{

sort(deno, deno + n);

// Initialize result

vector<int> ans;

// Traverse through all denomination

for (int i = n - 1; i >= 0; i--) {

 // Find denominations

 while (V >= deno[i]) {

  V -= deno[i];

  ans.push_back(deno[i]);

 }

}

// Print result

for (int i = 0; i < ans.size(); i++)

 cout << ans[i] << " ";

}

// Driver program

int main()

{

int n = 93;

cout << "Following is minimal"

 << " number of change for " << n

 << ": ";

findMin(n);

return 0;

}

Explanation:

PLS MARK ME BRAINLIST PLS