NIST

subset

(definition)

Definition: A set S1 is a subset of another set S2 if every element in S1 is in S2. S2 may have exactly the same elements as S1.

Formal Definition: S1 ⊆ S2 iff ∀ s, s ∈ S1 → s ∈ S2.

Specialization (... is a kind of me.)
proper subset, combination.

See also superset.

Note: If S1 is a subset of S2, S2 is a superset of S1.

A combination is a subset with exactly n elements.

Author: PR

Implementation

The Combinatorial Object Server's information on subsets (Pascal and C); generating subsets (Fortran, Mathematica, and Pascal)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:08 2006.

Cite this as:
Patrick Rodgers, "subset", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/subset.html

to NIST home page