Suppose each set is represented as a linked list with elements in arbitrary…
GATE · 2004 · CS
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?
- A.
union only
- B.
intersection, membership
- C.
membership, cardinality
- D.
union, intersection
Attempted by 576 students.
Sign up free to check your answer
Sign up freeLoading lesson…