Do I need bottom <= top in my while loop for binary search?

Question

public static int binSearch (double[] list, double item)
{
   int bottom = 0;                 // lower bound of subarray
   int top = list.length - 1;         // upp