What is a hash table in C++?

Can you explain what a hash table is in C++?

A hash table is a data structure that implements an associative array, allowing for fast data retrieval.

How does a hash table work internally?

It uses a hash function to compute an index into an array of buckets or slots, where the desired value can be found.

What are the advantages of using a hash table?

Hash tables provide average-case constant time complexity for lookups, insertions, and deletions.

Can you show me a simple example of a hash table in C++?

Sure! Here's a basic example:

#include <iostream>
#include <unordered_map>

int main() {
    std::unordered_map<std::string, int> hashTable;
    hashTable["apple"] = 1;
    hashTable["banana"] = 2;
    std::cout << "Apple: " << hashTable["apple"] << "\n";
    return 0;
}