Algorithms and Complexities:

5. Find an efficient data structure for representing a subset S of the integers from 1 to n Operations we wish to perform on the set are: INSERT(i): insert the integer i to the set S. If i is already in the set, this instruction must be ignored. DELETE: delete an arbitrary member from the set. MEMBER(i): check whetheri is a member of the set Your data structure should enable each one of the above operations in constant time (irre- spective of the cardinality of S)