Pseudocode only please Assuming you have sorted the given ar

Pseudocode only please.

Assuming you have sorted the given array, write a program to perform a binary search for the element \"pony\".

Solution

Full Working Code :
public class BinarySearch {

public static int BinarySearchOnString(String[] animals, String key) {

int start = 0, end = animals.length;

while (start < end) {

int mid = (start + end) / 2;

if (key.compareTo(animals[mid])== 0) {

   return mid;

   } else if (key.compareTo(animals[mid]) > 0) {

   start = mid + 1;

} else {

   end = mid;

}

}

return -1;

}

  

public static void main(String args[])

{

      

   String arr[] = new String[]{\"bird\",\"cat\",\"dog\",\"duck\",\"elephant\",\"monkey\",\"snake\"};

   System.out.println(BinarySearchOnString(arr,\"dog\"));

   System.out.println(BinarySearchOnString(arr,\"snake\"));

      

      

}

}

Pseudo Code :

Algorithm BinarySearchString (String arr[] , String key)
START
int start <--0
int end <--arr.length
while (start < end)
  int mid = (start + end) /2
if (key.compareTo(animals[mid])== 0)
return mid
elseif (key.compareTo(animals[mid])>0)
start = mid +1
  else
   end = mid;

return -1

END