CHALLENGE

ACTIVITY

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

$522562\mathrm{.}3578194\mathrm{.}9329qy7$

Jump to level $1$

Character letterMatch and integer numData are read from input. Then, numData alphabetically sorted characters are read from input and each character is added to an ArrayList. Complete the findData$(0$ method:

If letterMatch is found at index midlndex of the ArrayList, output letterMatch, followed by $"$is found at index $"$ and the value of midindex.

Else if rangeSize is $1,$ output letterMatch, followed by $"$is not in the list".

Otherwise, output letterMatch, followed by $"$is not found at index $"$ and the value of midlndex.

End each output with a newline.

Click here for example

Note:

char$1==$ char$2$ returns true if char$1$ is equal to char$2,$ and returns false otherwise.

No recursive call is needed.

$\}$

public static void main$($String$[]$ args$)\{$

Scanner scnr $=$ new Scanner$($

System.in$)$;

Arraylist $$ Character $>$ datalist $=$ new Arraylist $$ Character $>()$;

Character letterMatch;

int numData;

int $i$;

letterMatch $=scnr*next()*charAt()$;

numData $=$ scnr$.$ nextInt$()$;

for numData ;$++i$