Re: Q: Efficiency of Array Implementation

[S.D.Mechveliani]

I thought efficient arrays are impossible in functional language.
Binary trees to be used instead, and still they will be much slower
than C array. So we have to organise the data so that to avoid the 
access by index - as possible. Also the C array holds the block of
memory, no matter what part of it is used. And a binary balanced tree
- it takes and returns the cells flexibly.

Sergey Mechveliani
[EMAIL PROTECTED]