Source: wikibot/k-way-merge-algorithm
= K-way merge algorithm
{wiki=K-way_merge_algorithm}
The K-way merge algorithm is a generalization of the two-way merge process used in merge sort, which allows for the merging of more than two sorted lists (or arrays) into a single sorted output. The algorithm is particularly useful in contexts such as external sorting, where data sets are too large to fit into memory and are stored on disk.