Ways to make change (naive approach and dynamic programming approach)

Change.java

class Change {
    static int countDP(int coins[], int cents) {
        int[] table = new int[cents + 1];
        table[0] = 1;

        for (int coin : coins) {
            for (int j = coin; j <= cents; j++) {
                table[j] += table[j - coin];
            }
        }

        return table[cents];
    }

    static int countNaive(int S[], int m, int n) {
        if (n == 0) {
            return 1;
        }

        if (n < 0 || m <= 0) {
            return 0;
        }

        return countNaive(S, m - 1, n) + countNaive(S, m, n - S[m - 1]);
    }
}