Note that the cheap linked-list operation is cheaper than the cheap array operation. Ordered array search is O(log n), while linked-list insertion is constant time.
This page last modified on 24 January 2006.