🚀 go-pugleaf

In article <21@euteal.UUCP> mart@euteal.UUCP (Mart van Stiphout) writes:
>
>I hereby propose to do away with linear linked lists.
>Instead we should use flexible arrays or sparse arrays.
>A sparse array can be thought of as a linked list but not implemented
>as one.

An obvious follow up question (which doubtless everyone else knows the
answer to): Are there data structures that give the same operations as
linked lists but which are more efficient for random access and for
operations like sorting?

Please reply by e-mail, there is so much stuff in this group that I
can't read all of it.