K-way merge algorithm: Difference between revisions

Content deleted Content added
m Spelling/grammar/punctuation/typographical correction
Adding local short description: "Sequence merge algorithm in computer science", overriding Wikidata description "type of merge algorithm"
 
Line 1:
{{Short description|Sequence merge algorithm in computer science}}
{{DISPLAYTITLE:''k''-way merge algorithm}}
In [[computer science]], '''''k''-way merge algorithms''' or multiway merges are a specific type of [[Merge algorithm|sequence merge algorithms]] that specialize in taking in k 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. Two-way merges are also referred to as binary merges. The k-way merge is also an external sorting algorithm.