What is hash table in c# and when we should use it

In C#, a hash table is implemented using the `Hashtable` class or, more commonly, the `Dictionary<TKey, TValue>` class in the `System.Collections.Generic` namespace. Both are used for storing key-value pairs, but `Dictionary<TKey, TValue>` is more type-safe and generally preferred over `Hashtable`.

### When to use a hash table (Dictionary in C#):

1. Fast Retrieval: Hash tables provide fast retrieval of values based on their associated keys. This is particularly useful when you need quick access to data based on some identifier.

2. Unordered Collection: If the order of elements doesn't matter, and you need to store and retrieve data based on unique keys, a hash table is a good choice.

3. Associative Mapping: When you want to establish an association between keys and values, such as mapping usernames to user profiles or IDs to corresponding objects.

4. Efficient Search: Hash tables provide O(1) average time complexity for retrieval, making them efficient for search operations when the number of elements is not too large.

### Example Usage:

```csharp code ```

using System;

using System.Collections.Generic;

class Program

{

    static void Main()

    {

        // Creating a Dictionary

        Dictionary<string, int> ageMap = new Dictionary<string, int>();

        // Adding key-value pairs

        ageMap.Add("John", 25);

        ageMap.Add("Alice", 30);

        ageMap.Add("Bob", 28);

        // Retrieving values by key

        Console.WriteLine("John's age: " + ageMap["John"]);

        Console.WriteLine("Alice's age: " + ageMap["Alice"]);

        Console.WriteLine("Bob's age: " + ageMap["Bob"]);

    }

}

Use a hash table when you need efficient and quick access to values based on their associated keys, especially in scenarios where unordered collection and fast search operations are essential.