public static int binarySearch(List list, T key)private static boolean binarySearch(int[] pool, int target) { int left = 0, right = pool.length - 1; int middle; boolean found = false; while(!found && left <= right) { middle = left + (right - left) / 2; if(pool[middle] == target) { found = true; } else if(pool[middle] < target) { left = middle + 1; } else { right = middle - 1; } } return found; }