Jump to content

Talk:K-way merge algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Prstalis (talk | contribs) at 15:23, 28 January 2024 (Sentence has some problem: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer science Start‑class
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Things you can help WikiProject Computer science with:

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]