Say i have n vectors that are sorted. I can't think of a better algorithm to merge than searching the first of all n vectors to find minimum then pop that then continue. I think this would be too slow, but I can't think of anything more efficient.

Thanks

Michael