Search misses and insertions in an (unordered) linked-list symbol table having
N key-value pairs both require N compares, and search hits N compares in the worst case.
In particular, inserting N distinct keys into an initially empty linked-list symbol table
uses ~N-squre/2 compares.
