Binary Search Algorithm

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

public class BinarySearch { public static void main(String[] args) { BinarySearch obj = new BinarySearch(); int arr[] = { 2, 3, 45, 56, 67, 77, 78, 88 }; obj.search(arr, 3); } int mid; public void search(int[] arr, int key) { int low = 0, high = arr.length; while (low < high) { mid = (low + high) / 2; if (arr[mid] == key) { System.out.println("Element found at: " + mid); } if (key > arr[mid]) { low = mid + 1; } else { high = mid - 1; } } } }

Output:
 Element found at: 1