hii
unknown
java
a year ago
652 B
5
Indexable
public class binarySearch { // Binary Search public static int binarySearches(int numbers[], int key) { int start = 0, end = numbers.length - 1; while (start <= end) { int mid = (start + end) / 2; // comparison if (numbers[mid] == key) { return mid; } if (numbers[mid] < key) { start = mid + 1; } else { end = mid - 1; } } return -1; } public static void main(String args[]) { int numbers[] = { 2, 4, 6, 8, 10, 12, 14 }; int key = 110; System.out.println("Index for key is : " + binarySearches(numbers, key)); } }
Editor is loading...
Leave a Comment