public class BinarySearch {
    int [] table = new int[14];
    
    public void init() {
	int growing = 0;
	for (int i = 0 ; i < table.length ; i++ ) {
            growing += (int)(Math.random() * 6);
            table[i] = growing;
        }
    }
    
    public void start() {
    	if (search(23))
    	    System.out.println("Found it!");
    	else
    	    System.out.println("Not present.");
    }
    
    public boolean search(int value) {
    	int low = 0, high = table.length - 1;
    	int middle;
    	
    	while (low <= high) {
    	    middle = (low+high)/2;
    	    if (table[middle] == value)
    	        return true;
    	    if (table[middle] < value)
    	        low = middle + 1;
    	    else
    	        high = middle - 1;
    	}
    	
        return false;
    }
}