test2

public int findNumber(ArrayList<Integer> list, int n) {
		boolean found = false;
		int i = 0;
		int position = 0;
		while (!found && i < list.size() - 1) {
			for (i = 0; i < list.size() - 1; i++) {
				int k = list.get(i); // for each index in the list, compare i to k
				if (k == n) {
					position = i;
					found = true;
					int temp = list.indexOf(k); // temp = index of k
					if (temp > 0) { // if temp = zero, nothing should happen
						list.remove(position); // position is removed from list
						list.add(temp - 1, n); // n is added to list, one position left of where it was before
						int toReturn = temp; // toReturn = n's former index
						return toReturn;
					}
				}
			}
		}
		if (found) {
			return position;
		} else {
			return -1;
		}
	}