When searching for the presence of an element in a sequence, which data structure provides a faster check: Set or array?

To check for the presence of an element in a sequence, the Set data structure provides a faster operation than an array.

Set is usually implemented using a hash table, which allows search operations to be performed in close to O(1) time. In contrast, searching in an array requires iterating over the elements (linear search), which takes O(n) time in the worst case.

Example:

• Checking for an element in a Set: very fast, regardless of size.
• Checking in an array: you need to go through the elements until you find the desired one or reach the end of the array.