Subsets I I Algorithm

That is, all components of A are also components of B. A and B may be equal; if they are unequal, then A is a proper subset of B. The relationship of one set being a subset of another is named inclusion or sometimes containment. In fact, the subsets of a given set form a Boolean algebra under the subset relation, in which the join and meet are given by intersection and union, and the subset relation itself is the Boolean inclusion relation.

Subsets I I source code, pseudocode and analysis