What are the advantages of hash tables compared to arrays?

Access to elements by hash in O(1) on average, compared to O(1) by index.

Insertion and deletion of elements in O(1) on average, compared to O(n) in an array when inserting/deleting in the middle.

Storing key-value pairs that provide semantic identification of data by key.

Flexibility regarding key types (hashable objects), whereas arrays use numeric indices.

Efficiency in memory usage when working with sparse data.

# Example of access in an array
my_array = [10, 20, 30]
element = my_array[1] # Access by index

# Example of access in a dictionary (hash table)
my_dict = {"a": 10, "b": 20, "c": 30}
element = my_dict["b"] # Access by key