As a general rule, should C programs use linked lists or dynamic arrays?
Name:
Anonymous2013-03-19 12:07
>>52 One way to get both O(1) insertion and O(1) indexing from a linked list is to build a "dynamic" array on the first indexing operation as a cache. IIRC Firefox does this for its DOM node structures.
Why cant Racket or Common Lisp do that?