Binary Search

BinarySearch.java

public class BinarySearch {

	public static int search(int[] sorted, int element) {
		int min = 0;
		int max = sorted.length;
		while(max > min) {
			int mid = min + (max - min) / 2;
			if(sorted[mid] == element) {
				return element;
			} else if(sorted[mid] < element){
				min = mid + 1;
			} else {
				max = mid - 1;
			}
		}
		return -1;
	}

	public static void main(String[] args) {
		System.out.println(search(new int[]{1,2,3,4,5}, 3));
		System.out.println(search(new int[]{1,2,3,4,5}, 12));
		System.out.println(search(new int[]{1,2,3,4,5}, 1));
	}
	
}