lsuppose we have the following characters we want to put into a sorted list:t,
a, c, x, e, w.
lCall Insert on t, creating a list of one entry that conceptually looks like (L,
lNext, to insert the a, we use a loop to Advance until we find an entry the is alphabetically past the a.In this case, that happens right away.As
soon as we see the t, we stop the advancing loop and do an Insert, resulting in (L, at).
lNext we Reset and then Advance until we find an element past c.This happens
at the position, (a, t).Calling Insert
results in (a, ct).Now Reset and continue with the x.This causes us to advance until we reach the end of the list where we do
an insert, getting (act,
x).We continue in this way until all
of the elements have been