Q40

MCQ2 marks, −0.5

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest?

(A)

$\text{union}$ only

(B)

$\text{intersection, membership}$

(C)

$\text{membership, cardinality}$

(D)

$\text{union, intersection}$

Loading…