3 ms·
A linked list is not faster than a hash in looking up an element. The operation is O(N) for a linked list and O(1) for a hash.
by cmelbye 13y ago
A linked list is not faster than a hash in looking up an element. The operation is O(N) for a linked list and O(1) for a hash.