Subj : Looking for a nice data structure for lists...
To   : comp.programming
From : DV
Date : Mon Oct 10 2005 12:18 pm

Is there a data structure for lists such that a list can be split in
half in constant time or its middle element found in constant time
(such as an array pointer + size variable) but also such that two lists
can be merged in constant time (such as a linked list)?  This isn't a
homework problem.

It seems like if you take the arraylike properties, you are forced to
forfeit the linkedlistlike properties...  it would be extremely nice to
have some data structure that has both :/

Thanks for any help here
DV

.