Skip to content

aneksamun/greedy-coin-change

Repository files navigation

Implemantation of Greedy coin change algorithm

Having balance

  • 1p x 100,
  • 2p x 100,
  • 5p x 100,
  • 10p x 100,
  • 20p x 100,
  • 50p x 100,
  • £1 x 100,
  • £2 x 100,
  • £5 x 50,
  • £10 x 50,
  • £20 x 50,
  • £50 x 50

Application calculates the least number of coins/notes.

Example

Enter amount: 120
Optimal change: £1x1, 20px1

About

Greedy coin change algorithm implementation

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages