Revision as of 23:23, 16 July 2017 by Peculiargoldfish (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A subset is a group of algorithms, typically all of which within that set have something in common, which can collectively be used to solve all cases of a certain type.

Examples of subsets include:

See Also