In C#, Dictionary is a generic collection which is generally used to store key/value pairs. Dictionary is defined under System.Collection.Generics namespace. It is dynamic in nature means the size of the dictionary is growing according to the need.
Key:- a.01 and Value:- C Key:- a.02 and Value:- C++ Key:- a.03 and Value:- C#
A Hashtable is a collection of key/value pairs that are arranged based on the hash code of the key. Or in other words, a Hashtable is used to create a collection which uses a hash table for storage. It is the non-generic type of collection which is defined in System.Collections namespace. In Hashtable, key objects must be immutable as long as they are used as keys in the Hashtable.
Key:- A3 and Value:- GeeksforGeeks Key:- A2 and Value:- to Key:- A1 and Value:- Welcome
Hashtable Vs Dictionary
|A Hashtable is a non-generic collection.||A Dictionary is a generic collection.|
|Hashtable is defined under System.Collections namespace.||Dictionary is defined under System.Collections.Generic namespace.|
|In Hashtable, you can store key/value pairs of the same type or of the different type.||In Dictionary, you can store key/value pairs of same type.|
|In Hashtable, there is no need to specify the type of the key and value.||In Dictionary, you must specify the type of key and value.|
|The data retrieval is slower than Dictionary due to boxing/ unboxing.||The data retrieval is faster than Hashtable due to no boxing/ unboxing.|
|In Hashtable, if you try to access a key that doesn’t present in the given Hashtable, then it will give null values.||In Dictionary, if you try to access a key that doesn’t present in the given Dictionary, then it will give error.|
|It is thread safe.||It is also thread safe but only for public static members.|
|It doesn’t maintain the order of stored values.||It always maintain the order of stored values.|
This article is attributed to GeeksforGeeks.org