How is the search speed of elements in HashSet implementation determined?

In Java's HashSet implementation, the speed of element lookup is determined by the internal use of HashMap. HashSet stores elements as keys in a HashMap, with dummy values.

The search speed depends on:

• The object's hash function: it converts the object into a hash code, which determines its position in the bucket array.
• Collisions: if multiple elements have the same hash, they go into the same bucket, and the search becomes linear in the number of elements in that bucket.

On average, with a good hash function and low collision levels, searching in HashSet is an O(1) operation (constant time). If there are many collisions, the time can degrade to O(n).

Example:

HashSet<String> set = new HashSet<>();
set.add("apple");
boolean exists = set.contains("apple"); // Fast hash-based search