Beginning Java Data Structures and Algorithms

Implementing Binary Search Recursively

To implement binary search recursively in Java, we'll follow these steps:

1. Using the pseudocode shown in Snippet 2.5, implement a recursive binary search function.
2. Provide another method with a signature that only contains the search item and the sorted array as input. This method will then call the recursive function with appropriate values as follows:

 public boolean binarySearch(int x, int[] sortedNumbers) 

Output

The following code shows the additional method making the initial call and the recursive function as follows:

public boolean binarySearch(int x, int[] sortedNumbers, int start,int end) {  if (start <= end) {    int mid = (end - start) / 2 + start;    if (sortedNumbers[mid] == x) return true;