Implementation of the proper superset operation in set theory,
which checks if set A is a superset of set B. A proper superset
means a set A is a superset of B, but B is not equal to A.
Formal definition: A ⊃ B
This method runs in bilinear time, or O(n * m), where n = |A|
(size of set A), and m = |B| (set of size B)
Implementation of the proper superset operation in set theory, which checks if set A is a superset of set B. A proper superset means a set A is a superset of B, but B is not equal to A.
A ⊃ B
O(n * m)
, wheren = |A|
(size of set A), andm = |B|
(set of size B)