Skip to content

Docs: add Javadoc to CoinChange class and method #7424

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
BixbyCodes wants to merge 4 commits into
base: master
Choose a base branch
from
+21 −1
Open

Docs: add Javadoc to CoinChange class and method #7424

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
4bd2ee8
Fix: remove floating Javadoc comments causing compilation error
BixbyCodes May 16, 2026
3629971
Docs: add Javadoc to CoinChange class and method
BixbyCodes May 16, 2026
a2253fb
Merge branch 'master' into master
BixbyCodes May 16, 2026
d4db321
Style: apply clang-format to CoinChange.java
BixbyCodes May 16, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 21 additions & 1 deletion src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,10 +6,30 @@

// Problem Link : https://en.wikipedia.org/wiki/Change-making_problem

/**
* The Coin Change problem finds the minimum number of coins needed
* to make a given amount using a greedy approach.
*
* <p>Note: This greedy approach works optimally for standard coin systems
* (like Indian currency), but may not work for all arbitrary coin sets.
* For arbitrary denominations, dynamic programming is preferred.
*
* @see <a href="https://en.wikipedia.org/wiki/Change-making_problem">Change-making problem</a>
*/
public final class CoinChange {
private CoinChange() {
}
// Function to solve the coin change problem

/**
* Returns the list of coins used to make the given amount
* using a greedy algorithm with standard denominations.
*
* <p>Time Complexity: O(n log n) where n is the number of coin denominations
* <p>Space Complexity: O(n)
*
* @param amount the total amount to make change for
* @return list of coins used to make the amount
*/
public static ArrayList<Integer> coinChangeProblem(int amount) {
// Define an array of coin denominations in descending order
Integer[] coins = {1, 2, 5, 10, 20, 50, 100, 500, 2000};
Expand Down
Loading