Content deleted Content added
m link multi-core processor using Find link |
Remove information uncited for more than 5 years (!!!) |
||
Line 1:
{{expert-subject|Computer science|date=August 2009}}
{{citations missing|date=August 2008}}
'''Merge algorithms''' are a family of [[algorithm]]s that run sequentially over multiple [[sorting algorithm|sorted]] lists, typically producing more sorted lists as output. This is well-suited for machines with [[tape drive]]s.
The general merge algorithm has a set<!--non-technical use, don't link--> of [[pointer (computer programming)|pointer]]s p<sub>0..n</sub> that point to positions in a set of lists L<sub>0..n</sub>. Initially they point to the first item in each list. The algorithm is as follows:
|