findNumber

public int findNumber(ArrayList<Integer> list, int n) {
        boolean found = false;
        int left = 0;
        int right = list.size() - 1;
        int middle = (left + right) / 2;
        int position = 0;
        while (!found && left <= right) {
            for (int i = 0; i < list.size() - 1; i++) {
                int k = list.get(middle);
                if (k == n) {
                    position = i;
                    found = true;
                } else if (k > n) {
                    right--;
                } else {
                    left++;
                }
            }
        }
        if (found) {
            return position;
        } else {
            return -1;
        }
    }