public static void binarySearch(int key, int lowerbound, int upperbound, List<Integer> list){
		System.out.println("Key: "+ key);
		int position = (lowerbound + upperbound)/2;
		
		while(list.get(position) != key && lowerbound <= upperbound){
			position = (lowerbound + upperbound)/2;
			
			if(list.get(position) < key)
				lowerbound = position + 1;
			else if(list.get(position) > key)
				upperbound = position - 1;
		}
		System.out.println("Found in index: "+position);
	}