From: Paul N on
On 13 June, 18:10, Chad <cdal...(a)gmail.com> wrote:
> A few days ago, on another
> forum, someone had asked which operation(s) on a singly linked list
> don't need to know the length of the list. I guess they meant
> operations that don't require the length of the list as one of the
> function arguments.

Any function can work out the length of a singly linked list, given a
pointer to the head. So, as I see it, no operations need the length as
a function argument. Some operations might be quicker if you keep
track of the length, and I think at least some kinds of sort would
fall into this category.