ANN: Edison 1.2RC4
ross at soi.city.ac.uk
Fri Jun 2 11:32:47 EDT 2006
On Thu, Jun 01, 2006 at 11:57:47PM -0400, Jim Apple wrote:
> the source for BinaryRandList at
> , I don't think the constant time bounds in the documentation are
> correct for this sequence type.
Indeed not. If you have a sequence of exactly 2^n elements and then
alternate between tail and cons, each operation will cost O(log n).
More information about the Libraries