Jump to content

Talk:K-way merge algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
(Redirected from Talk:K-Way Merge Algorithms)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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]