Revision as of 19:56, 29 November 2015 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Applications - statement about k-way sorts in memory: no wait, that's not correct ← Previous edit		Revision as of 22:26, 3 December 2015 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Applications - statement about k-way sorts in memory Next edit →
Line 103: :I made the statement more precise by specifying that the number of comparisons is being counted. [[User:Qwertyus\|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus\|hm?]])</small> 19:55, 29 November 2015 (UTC) ::I would recommend just removing the statement. A 4 way merge averages 3 compares for every move, versus 2 way merge averaging 1 compare for every move, but the 4 way does 1/2 the moves. So the number of compares of 4 way is 1.5 times the number of compares for 2 way, while the number of moves for 4 way is 1/2 the number of moves for 2 way. This is probably too much detail for the main article, which is about merge algorithms as opposed to sort algorithms. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 22:26, 3 December 2015 (UTC)

Talk:Merge algorithm: Difference between revisions