public static boolean binarySearch(int[] numbers, int toFind)
    {
        int end = numbers.length - 1;
        int start = 0;

        while(end >= start)
        {
            int mid = (end - start)/2 + start;

            if(numbers[mid] == toFind)
                return true;
            else if(numbers[mid] < toFind)
                start = mid + 1;
            else
                end = mid - 1;
        }

        return false;
    }