public class BinarySearch {
    public static void main(String[] args) {
        int data[] = {3, 6, 7, 10, 34, 56, 60};
        int numberToFind = 6;

        int min = 0;
        int max = data.length - 1;
        int mid = ((max - min) / 2) + min;

        while (numberToFind != data[mid]) {
            if (numberToFind < mid)
                max = mid - 1;
            else
                min = mid + 1;

            mid = ((max - min) / 2) + min;
        }
        System.out.println(mid);
    }
}