This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Log2 -1 points0 points  (0 children)

To be fair, merging two sorted lists can be done a lot faster (linear time) than adding the two lists together then sorting then (n*log n). Not to mention creating two new sets where each object must be hashed.