Question

Language should be java

Create a recursive function, int combinations (int n, int k) to calculate the number of ways to select k items from n items. Use this formula: morfin.. C(n, k) = { 0 if k=0 if n <k otherwise C(n-1, k-1) + C(n-1,k) Running your program should look like this: Enter an Integer: 6 Enter another Integer: 2 combinations (6,2) = 15 Enter an Integer: 8 Enter another Integer: 4 combinations (8,4) = 70

Answer 1

import java.util.Scanner;

public class Combinations {

    public static int combinations(int n, int k) {
        if (k == 0)
            return 1;
        else if (n < k)
            return 0;
        else
            return combinations(n - 1, k - 1) + combinations(n - 1, k);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        System.out.print("Enter an integer: ");
        int n = in.nextInt();
        System.out.print("Enter another integer: ");
        int k = in.nextInt();
        System.out.println("combinations(" + n + "," + k + ") = " + combinations(n, k));
    }
}

Enter an integer: 8 Enter another integer: 4 combinations (8,4) = 70 Process finished with exit code o