Consider sets whose elements are (or can be mapped to) integers in the range [0, N-1].
A popular scheme for representing a set A of this type is by means of a Boolean vector, B, where we say that x is in A if and only if B[x] = true. Since each cell of B can be represented with a single bit, B is sometimes referred to as a bit vector.
Describe efficient algorithms for performing the union, intersection, and subtraction methods of the set ADT assuming this representation. What are the running times of these methods?
Thanks in advance!
