Given two sorted lists $$L1$$ and $$L2$$, the fastest algorithm
Given two sorted lists $$L1$$ and $$L2$$, the fastest algorithm for computing $$L1\bigcup L2$$ has time complexity $$\Theta(N)$$. ~@[](2)答案:TRUE
-->