Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!cs.utexas.edu!sm.unisys.com!hplabs!hp-sdd!ncr-sd!ncrlnk!uunet!mcvax!ukc!etive!aiai!ken
From: ken@aiai.ed.ac.uk (Ken Johnson)
Newsgroups: comp.lang.misc
Subject: Re: flexible arrays
Keywords: programming languages, flexible arrays.
Message-ID: <133@skye.ed.ac.uk>
Date: 2 Feb 89 12:25:20 GMT
References: <21@euteal.UUCP>
Reply-To: ken@aiai.UUCP (Ken Johnson)
Followup-To: comp.lang.misc
Organization: AIAI, University of Edinburgh, Scotland
Lines: 14

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.