Problem with binary search

[Chi]

Hi everyone.
Can anyone tell me how to create an array of Comparable objects to test my binary search? I need to create a driver

public class Searching public static Comparable binarySearch (Comparable[] data,
                                          Comparable target)
   {
      Comparable result = null;
      int first = 0, last = data.length-1, mid;

      while (result == null && first <= last)
      {
         mid = (first + last) / 2;  // determine midpoint
         if (data[mid].compareTo(target) == 0)
            result = data[mid];
         else
            if (data[mid].compareTo(target) > 0)
               last = mid - 1;
            else
               first = mid + 1;
      }

      return result;
   }

}

[Chi]

To any of my friends in CSC205, to create a recursive algorithm of the binary search, you need to have a helper method that performs the recursive part. The binary search only returns what you found using the helper method.