Talk:K-way merge algorithm

This is the current revision of this page, as edited by Cewbot (talk | contribs) at 08:47, 4 February 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computer science}}.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Latest comment: 1 year ago by Prstalis in topic Sentence has some problem

I want to improve the section about tournament trees. Specifically, I want to add a better example (the current one uses a winner tree but a loser tree has better performance) and want to add more details to the algorithm (example code, running time). Tournament trees have a better running time than heaps (factor 2). Therefore, I want to move the section about tournament trees above the section about heaps. Is someone against it? ByteHamster (talk) 11:58, 25 March 2019 (UTC)Reply

Sentence has some problem

In the first paragraph of the article we have sentence with a grammar problem:

   The k- way merge also external sorting algorithm.

This is needs to be fixed I also let the author know in her talk page Prstalis (talk) 15:23, 28 January 2024 (UTC)Reply