Re: Help needed - Upper Bound of an array - Question.

["Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr>]

Le Tue, 07 Feb 2012 16:08:11 +0100, Ludovic Brenta  
<ludovic@ludovic-brenta.org> a écrit:
> Alternatively, you should consider replacing the array
> with a rope (see  
> http://en.wikipedia.org/wiki/Rope_%28computer_science%29).
Or alternatively again, and as we can suppose there will be no insertion  
or removal (so much inefficient with an array, he would not have choose an  
array), a balanced binary tree, which is very fast and easy when created  
for a given fixed size. I did it some years ago, on a machine with heap  
fragmentation and no virtual memory. Above all, appending is still fast  
and simple, if ever the size has to be increased.

-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University