CHALLENGE

ACTIVITY

$2\mathrm{.}3\mathrm{.}2$: Recursive algorithm: Search.

$522562\mathrm{.}3578194\mathrm{.}4329y7$

Jump to level $1$

String targetState and integer numData are read from input. Then, numData alphabetically sorted strings are read from input and each string is added to an ArrayList. Complete the find $0$ method:

If targetState is alphabetically before midValue $($the element at index midlndex of the ArrayList$),$ output "Search lower half" and recursively call find $0$ to find targetState in the lower half of the range.

Otherwise, output "Search upper half" and recursively call find$(0$ to find targetState in the upper half of the range.

End each output with a newline.

Click here for example

Note: str$1.$compareTo$($str$2)<mtext\; id="EditorElement\_48952"></mtext><mn\; id="EditorElement\_48953">0</mn>$ returns true if str$1$ is alphabetically before str$2,$ and returns false otherwise.

import java.util.Scanner;

import java.util.ArrayList;

public class FindState $\{$

public static void find$($ArrayList