Content deleted Content added
Line 97:
As a side note, I think a mention to Hwang-Lin binary merging algorithm should be done. Also the information theory limit for the worst case comparaison.--[[User:Azrael60|Azrael60]] ([[User talk:Azrael60|talk]]) 16:05, 13 January 2008 (UTC)salem ghnaimat
==Applications - statement about k-way sorts in memory ==
This section includes the statement: ''A k-way in-memory merge sort can also be constructed from a k-way merge algorithm, but his provides no benefits over the ordinary binary merge sort.'' On a processor with 16 registers, such as a PC in 64 bit mode, a 4-way merge sort using 10 or so pointers that a compiler optimizes by using registers for all those pointers will result in a 4-way merge sort being somewhat faster than a binary merge sort, and about as fast as quick sort. PC based benchmarks showed the 4-way merge sort was about 15% faster than binary merge sort. [[User:Rcgldr|Rcgldr]] ([[User talk:Rcgldr|talk]]) 19:19, 29 November 2015 (UTC)
| |||