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 executed 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;

Question

Sasha

Computers & Technology

11 September, 06:38

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 executed 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;

+1

Answers (1)

Know the Answer?

Susan Hernandez · Answer 1

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;