Revision as of 11:58, 25 March 2019 edit ByteHamster (talk \| contribs) 38 edits No edit summary ← Previous edit		Revision as of 15:23, 28 January 2024 edit undo Prstalis (talk \| contribs) 9 edits →Sentence has some problem: new section Tag: New topic Next edit →
Line 2: 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? [[User:ByteHamster\|ByteHamster]] ([[User talk: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 [[User talk:Ammulya\|talk page]] [[User:Prstalis\|Prstalis]] ([[User talk:Prstalis\|talk]]) 15:23, 28 January 2024 (UTC)

Talk:K-way merge algorithm: Difference between revisions