fore pushing a thousand new elements on v. In this
way you avoid a lot of copying overhead.
Best regards!
Thanks for responding, and especially for finding that information about
vlists!
Christopher Diggins
http://www.cdiggins.com
rative loops over the entire collection.
is about as fast as for a fixed size array.
Christopher Diggins
http://www.cdiggins.com
and worst case, and the property of O(1) indexing in the
average case and O(LogN) in the worst case. Is this a noteworthy
observation, or is it common knowledge amongst members of the
alogrithmic research community.
Thanks
Christopher Diggins
http://www.cdiggins.com
