Talk:K-way merge algorithm - Revision history

Cewbot: 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}}.

2024-02-04T08:47:30Z

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}}.

← Previous revision		Revision as of 08:47, 4 February 2024
Line 1:		Line 1:
	{{WikiProject ~~Computer science~~ \|class=Start}}		{{WikiProject banner shell\|class=Start\|
			{{WikiProject Computer science }}

			}}
	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)		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)

Prstalis: /* Sentence has some problem */ new section

2024-01-28T15:23:00Z

Sentence has some problem: new section

← Previous revision		Revision as of 15:23, 28 January 2024
Line 2:		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)		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)

ByteHamster at 11:58, 25 March 2019

2019-03-25T11:58:02Z

← Previous revision		Revision as of 11:58, 25 March 2019
Line 1:		Line 1:
	{{WikiProject Computer science \|class=Start}}		{{WikiProject Computer science \|class=Start}}

			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)

Meno25: Assessment: Computer science: class=Start (assisted)

2019-02-05T13:44:41Z

Assessment: Computer science: class=Start (assisted)

← Previous revision		Revision as of 13:44, 5 February 2019
Line 1:		Line 1:
	{{WikiProject Computer ~~Science~~\|class=~~Draft~~}}		{{WikiProject Computer science \|class=Start}}

Pzoxicuvybtnrm: Pzoxicuvybtnrm moved page Talk:K-way merge algorithms to Talk:K-way merge algorithm: should be singular

2017-12-09T21:38:31Z

Pzoxicuvybtnrm moved page Talk:K-way merge algorithms to Talk:K-way merge algorithm: should be singular

← Previous revision	Revision as of 21:38, 9 December 2017
(No difference)

Pzoxicuvybtnrm: Pzoxicuvybtnrm moved page Talk:K-Way Merge Algorithms to Talk:K-way merge algorithms: capitalisation conventions for article titles

2017-12-09T21:37:50Z

Pzoxicuvybtnrm moved page Talk:K-Way Merge Algorithms to Talk:K-way merge algorithms: capitalisation conventions for article titles

← Previous revision	Revision as of 21:37, 9 December 2017
(No difference)

SwisterTwister: SwisterTwister moved page Draft talk:K-Way Merge Algorithms to Talk:K-Way Merge Algorithms: Publishing accepted Articles for creation submission (AFCH 0.9)

2015-11-23T05:09:30Z

SwisterTwister moved page Draft talk:K-Way Merge Algorithms to Talk:K-Way Merge Algorithms: Publishing accepted Articles for creation submission (AFCH 0.9)

← Previous revision	Revision as of 05:09, 23 November 2015
(No difference)

Dodger67: WikiProject

2015-11-22T09:16:05Z

WikiProject

New page