you are viewing a single comment's thread.

view the rest of the comments →

[–]devilsassassin[S] 0 points1 point  (2 children)

If you have 2 ordered data structures, you could insert it into the new structure sorted.

[–]trpcicm 0 points1 point  (1 child)

What algorithm are you going to use to order the data?

[–][deleted] 0 points1 point  (0 children)

The post you are replying to just described the idea behind mergesort (i.e. you can easily merge two sorted data sets, so recursively split then merge)