What will be if we Write a program in java to accept the amount of money to be withdrawn and find out the number of notes of each denomination to be given by the bank?

Answer 1

Use a recursive function. Assume the denominations are placed in a vector of type double (highest denomination first):

// returns the highest denomination not greater than value

const double get_largest_denom (const double& value) {

const std::vector<double> denoms {100.0, 50.0, 20.0, 10.0, 5.0, 2.0, 1.0, 0.5, 0.2, 0.1, 0.05, 0.02, 0.01};

for (auto const i : denoms) if (*i <= value) return *i;

return 0.0; // rare case!

}

void print_amounts (double value) {

if (value<=0.0) return;

double denom {get_largest_denom (value); }

unsigned count {(unsigned) (value / denom)};

double subtotal {(double) count * denom};

std::cout << count << " x " << denom " = " << subtotal << std::endl;

print_amounts (value - subtotal);

}

int main (void) {

double value {};

std::cout << "Enter the amount (#.##): ";

std::cin >> &value;

print_amounts (value);

}

Example output:

Enter the amount (#.##): 1234.56

12 x 100.0 = 1200.0

3 x 10.0 = 30.0

4 x 1.0 = 4.0

1 x 0.5 = 0.5

1 x 0.05 = 0.05

1 x 0.01 = 0.01