Chapter 5, Problem 2R

Explanation of Solution

Modified Recursive binary search algorithm:

The modified recursive binary search method is given below:

//Define the binarySearch() method

public static int binarySearch(int[ ] data, int target, int low, int high)

{

  //Check "low" is greater than "high"

  if (low > high)

  //Return the -1

  return −1;

  //Execute the else part

  else

  {

/*Add "low" and "high" and the result is divided by 2 and then store the result element to "mid". */

int mid = (low + high) / 2;

  //Check "target" is equal to "data[mid]"

if (target == data[mid])

  //Return the index of search element

  return mid;

  //Execute the else part

else if (target < data[mid])

  //Call the binarySearch() method

return binarySearch(data, target, low, mid − 1);

  //Execute the else part

 ;&#x...