public static void binarySearch(int[] array) {
		if (array.length <= 2)
			System.out.println("No such value in the array.");
		int left = 0;
		int right = array.length - 1;
		while (right > left + 1) {
			int middle = (left + right) / 2;
			if (middle == 0 || middle == array.length - 1) {
				System.out.println("No such value in the array.");
			
			}
			if (array[middle] >= array[middle - 1] && array[middle] > array[middle + 1]) {
				System.out.println("Find such value. Index is " + middle + ".");
				return;
			} else if (array[middle] >= array[middle - 1] && array[middle] <= array[middle + 1]) {
				left = middle;
			} else {
				right = middle;
			}
		}
		System.out.println("No such value in the array.");
	}