In theworst case of enqueue(), additional instructions
for searching the end of the list must be taken into account
(see also lines 5–7 of Figure 4). The clock cycles consumed,
however, depend on the length of that list. The additional
overhead for a single iteration amounts to 3 instructions.
In case of dequeue(), the worst case adds instructions
for (1) preparation of element requeuing (line 6 of Figure
5) and (2) element requeuing itself (lines 8–11 of Figure
5). Again, the number of clock cycles consumed for the
second step depends on the queue length. Also note that
requeuing is implemented using enqueue(). The additional
dequeue() overhead in the worst case, excluding
enqueue(), is 24 instructions.