Content deleted Content added
Woohookitty (talk | contribs) m Disambiguate Pointer to Pointer (computing) using popups |
|||
Line 2:
'''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. Use has declined due to large [[random access memory|random access memories]], and many applications of merge algorithms have faster alternatives when a random-access memory is available.{{Fact|date=May 2009}}
The general merge algorithm has a set<!--non-technical use, don't link--> of [[Pointer (computing)|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:
While any of p<sub>0..n</sub> still point to data inside of L<sub>0..n</sub> instead of past the end:
| |||