On Fri, 8 Jun 2001, Jarkko Hietaniemi wrote:
> An interesting article in the July DDJ) in the Algorithm Alley:
> "Fast and Small Resizable Arrays", presents a datastructure that
> promises just what the subject says.
The first thing I thought of after reading the article was "use less
memory"...
An interesting article in the July DDJ) in the Algorithm Alley:
"Fast and Small Resizable Arrays", presents a datastructure that
promises just what the subject says. Appending elements has the worst
case of O(sqrt(N)), as is the space wastage (which is the optimum, as
opposed to the usual wastage
