package BinarySearch;

import java.util.List;

/**
 * Created by tvoyamamka on 08.07.2014.
 */
public class BinarySearch {
    public static int search(List<Integer> list, int x, int start, int end){
        while(end>=start){
            int middle = start/2+end/2;
            System.out.println(middle);

            if(list.get(middle)== x ){
                return middle;
            }
            else if(list.get(middle) < x){
                start=middle+1;
            }
            else if(list.get(middle) > x) {
                end=middle-1;
            }
        }
    return -1;
    }
}