Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] ================================================ import java.util.*; public class RecursiveMin { public static void main(String[] args) { Scanner input = new Scanner(System.in); ArrayList numbers = new ArrayList(); while (true){ System.out.println("Please enter numbers. Enter -1 to quit: "); int number = input.nextInt(); if (number == -1){ break; } else { numbers.add(number); } } int minimum = findMinimum(numbers); System.out.println("Minimum: " + minimum); } public static int findMinimum(ArrayList numbers) { // Base Case: What is the smallest ArrayList you can have? // What is the minimum value of that array? // Recursive call: How do you find the minimum of the rest of the ArrayList? // (Not including the last element) // Return: The minimum of (the last element, minimum of the rest of the ArrayList) } }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Write a recursive function that finds the minimum value in an ArrayList.

Your function signature should be

public static int findMinimum(ArrayList<Integer>)

One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”.

For example, if you have the ArrayList

[1, 3, 2, 567, 23, 45, 9],

the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45]

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

import java.util.*;

public class RecursiveMin
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);

ArrayList<Integer> numbers = new ArrayList<Integer>();

while (true){
System.out.println("Please enter numbers. Enter -1 to quit: ");
int number = input.nextInt();

if (number == -1){
break;
}
else {
numbers.add(number);
}
}

int minimum = findMinimum(numbers);
System.out.println("Minimum: " + minimum);
}

public static int findMinimum(ArrayList<Integer> numbers)
{

// Base Case: What is the smallest ArrayList you can have?
// What is the minimum value of that array?

// Recursive call: How do you find the minimum of the rest of the ArrayList?
// (Not including the last element)

// Return: The minimum of (the last element, minimum of the rest of the ArrayList)

}
}

Expert Solution