Talk:K-way merge algorithm

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)

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)