Sets

Collections of unique elements with fast membership tests.

Beginner

Hash sets are $O(1)$ average; tree sets keep elements sorted with $O(\log n)$ operations.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)