How does a hash table store data?

A hash table stores data by using key-value pairs and computing an index through a hash function. When a key is provided, the hash function generates a unique index (usually based on the key itself) that determines where the associated value will be stored in the hash table. This allows for efficient retrieval, insertion, and deletion of data, as accessing elements by their index is typically an O(1) operation on average.

The ability to rapidly access data makes hash tables particularly useful in various applications, including databases and caching mechanisms. The use of key-value pairs also allows for a flexible and straightforward way to represent data relationships, where each key directly maps to its corresponding value.

Organizing data into a linear array or utilizing stack data structures don’t align with how hash tables function; these structures have their own distinct methods for storing and accessing data. Maintaining a sorted list is contrary to the primary goal of a hash table, which emphasizes fast access over the order of elements. The index computed by the hash function leads directly to value storage, making option B the correct choice.