Actual hash table entries are 16 bytes each. By default the hash table load factor is set at 2.0, meaning that an average slot will have two items in it, and a table lookup can be done by comparing the key against two table elements. In the worst case, where every element to be inserted has the same hash code, a hash table will perform like a linked list. A Set object uses 13 bytes in addition to the underlying Hash object on which it is based. A Set by default starts out with 64 elements.
Performance is similar to Hash.
Time of these operations is linearly proportional to the size of each set. List A List object uses 38 bytes in addition to the space for elements stored in it. Each element uses 4 bytes. A List by default starts with 16 elements. SortedList SortedList is based on List and requires 4 bytes per object in addition to that required by List.