1 2 3 4 5 6 7 8
int Found(Cell *&first, int n){ Cell *p = first; int i = 1; while (p&& i<n) { i++; p = p->next; } return p->q; }