Suppose L is a LIST and p, q, and r are positions. As a function of n, the length of list L, determine how many times the functions FIRST, END, and NEXT are excused by the following program.
p := FIRST(L);
while p <> END(L) do begin
q := p;
while q <> END(L) do begin
q := NEXT(q,L);
r := FIRST(L);
while r <> q do
r := NEXT(r,L);
end;
p := NEXT(p,L);
end;
I need to know what eaxctly meant by the brackets
<> .... q<>END(L) does it mean as long as q is not at the end of the list?? please help!!!!