...It provides ordering and uniqueness guarantees, with all terms stored according to Elixir’s built-in sorting rules. Internally, it uses a vector of vectors layout rather than a single vector to minimize costly reallocations, allowing efficient bucket pointer copying instead of expensive term copying during growth. This design achieves a balance between performance and simplicity, and developers can customize bucket sizes for specific workloads, with a default of 500 offering solid performance across common scenarios. SortedSet extends beyond traditional set semantics by providing indexing, random access, and slice operations thanks to its deterministic ordering.