Question

Program Description:

Assignment #9 will be the construction of a program that reads in a sequence of integers from standard input until 0 is read, and store them in an array (including 0). This is done using iteration (choose one of for, while, or do while loop). You may assume that there will not be more than 100 numbers.

Then compute the minimum number, count odd integers, compute the sum of numbers that are larger than the first number in the array, and compute the largest even integer in the sequence using recursion. Thus, you will create recursive methods findMin, countOddNumbers, computeLargestEven, and sumOfNumbersLargerThanFirst in Assignment9 class and they will be called by a main method.

Specifically, the following recursive methods must be implemented (These methods should not contain any loop):

    public static int findMin(int[] numbers, int startIndex, int endIndex)

    public static int countOddNumbers(int[] elements, int startIndex, int endIndex)

    public static int computeLargestEven(int[] elements, int startIndex, int endIndex)

    public static int sumOfNumbersLargerThanFirst(int[] elements, int startIndex, int endIndex, int firstNumber)

If these methods are implemented using a Loop or any Static Variable, points will be deducted even if your program passes test cases. DO NOT use any Static Variables.

The program should output the results of those calculations to standard output. Your program will continue to read in numbers until the number 0 is entered. At this point, the calculations will be outputted in the following format:

• The minimum number is 0
• The count of odd integers in the sequence is 0
• The largest even integer in the sequence is 0
• The sum of numbers larger than the first is 0

Note that the result values will be different depending on test cases (not always 0).

Do not output a prompt to query for the numbers. The number 0 is included in the sequence of numbers and should be included in all of your calculations.

Answer 1

Thanks for the question, here are the recursive methods without using any loops

=======================================================================


public static int findMin(int[] numbers, int startIndex, int endIndex) {

    if (startIndex >= endIndex) return numbers[startIndex];

    int number = numbers[startIndex];
    int min = findMin(numbers, startIndex + 1, endIndex);
    return number < min ? number : min;
}

public static int countOddNumbers(int[] elements, int startIndex, int endIndex) {
    if (startIndex == endIndex) return elements[startIndex] % 2 == 1 ? 1 : 0;

    if (elements[startIndex] % 2 == 1) return 1 + countOddNumbers(elements, startIndex + 1, endIndex);
    else return countOddNumbers(elements, startIndex + 1, endIndex);

}

public static int computeLargestEven(int[] elements, int startIndex, int endIndex) {
    if (startIndex >= endIndex) {
        if (elements[startIndex] % 2 == 0) return elements[startIndex];
        else return 0;
    }

    int number = elements[startIndex];
    int largestEven = computeLargestEven(elements, startIndex + 1, endIndex);
    if (number % 2 == 0) {
        if (number > largestEven) return number;
        else return largestEven;
    } else {
        return largestEven;
    }
}

public static int sumOfNumbersLargerThanFirst(int[] elements, int startIndex, int endIndex, int firstNumber) {
    if (startIndex >= endIndex) {
        if (elements[startIndex] % 2 == 0 && elements[startIndex] > firstNumber) return elements[startIndex];
        else return 0;
    }
    if (elements[startIndex] % 2 == 0 && elements[startIndex] > firstNumber)
        return elements[startIndex] + sumOfNumbersLargerThanFirst(elements, startIndex + 1, endIndex, firstNumber);
    else return sumOfNumbersLargerThanFirst(elements, startIndex + 1, endIndex, firstNumber);

}

==================================================================