Hash table objects are quite similar to Array List Object. It is a collection of key-value pair
i.e(Key,Value) which are arranged according to key .It computes a hash for each key you add and look for hash code.
Add, Clear, Clone, Contain, ContainKey, Equals,Finalize, GetEnumerator, GetHash, GetHashCode, GetObjectData, GetType, KeyEquals, Remove, ToString
compare, Count,EqualityComparer, hcp, IsFixedSize, IsReadOnly, Item, Key, Values, IsSynchronised
It is slow when compared to Generic Dictionary.
• Key must be unique: Key uniqueness requirement that is very necessary to manipulate.
• No useful sorting: Sorting is not done by using keys or values. The items in the Hashtable are sorted internally to make it easy to find objects very quickly.
: Although the lookup is very quick in a Hashtable, the CLR must do quite a lot of work to maintain them that is very resource-intensive.