Question 9528 – Linked-List

Let no. of elements in list 1 be n₁.
Let no. of elements in list 2 be n₂.
Union:
To union two lists, for each element in one list we will search in other list, to avoid duplicates. So, time complexity will be O(n₁×n₂).
Intersection:
To take intersection of two lists, for each element in one list we will search in other list if it is present or not. So time complexity will be O(n₁ × n₂).
Membership:
In this we search if particular element is present in the list or not. So time complexity will be O(n₁ + n₂).
Cardinality:
In this we find the size of set or list. So to find size of list we have to traverse each list once. So time complexity will be O(n₁+n₂).
Hence, Union and Intersection will be slowest.