Definition: A set S1 is a superset of another set S2 if every element in S2 is in S1. S1 may have elements which are not in S2.
See also subset.
Note: If S1 is a superset of S2, S2 is a subset of S1.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Paul E. Black, "superset", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/superset.html