K-way merge algorithm: Difference between revisions

Revision as of 09:12, 22 November 2015

Revision as of 00:43, 23 November 2015

Line 7:

<!-- EDIT BELOW THIS LINE -->

In [[computer science]], ''', K-Way Merge Algorithms''' are a specific type of [[Merge algorithm|Sequence Merge Algorithms]] that specialize in taking in multiple sorted lists and merging them into a single sorted list. These merge algorithms generally refer to merge algorithms that take in a number of sorted lists greater than two. 2-Way Merges are referred to as binary merges on the other hand and are also utilized in k-way merge algorithms. K-way merge algorithms often find use in

__TOC__

== 2-Way Merge ==