Really? With flat array, once you've found the insertion/deletion point, you've to move (ave.) 50% of the array one place to accommodate/close up the array, but only a coupe of pointers to write for the linked list. Just wildly differing constants then.
(I guess i was think about trees rather than linked lists.)
In reply to Re^6: [OT] The interesting problem of comparing (long) bit-strings.
by BrowserUk
in thread [OT] The interesting problem of comparing bit-strings.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |