Hash tables use a hash function to map keys to array indices, allowing constant-time access to elements. In the average case, the hash function distributes the keys evenly, resulting in a constant number of probes to find the desired element. As a result, the time complexity of a search operation in a hash table is O(1).