This program demonstrates how to make change for 15 cents using 25, 10, 5, and 1 cent banknotes. It employs a recursive approach to backtracking to efficiently solve subproblems.
-
Worst Case: When the target amount is not equal to the first banknote in the array, the time complexity is O(N^2).
-
Best Case: When the target amount is equal to the first banknote in the array, the time complexity is O(1).
To use this program, simply clone the repository and run it in your preferred development environment.
git clone https://github.com/alpersarac/CoinChangerConsole.git
cd CoinChangerConsole