Revision as of 18:55, 26 September 2007 edit Azrael60 (talk \| contribs) 6 edits No edit summary ← Previous edit		Revision as of 16:05, 13 January 2008 edit undo Azrael60 (talk \| contribs) 6 edits →BEST KNOWN MERGE ALGORITHM Next edit →
Line 83: I would like to know which is the fastest of knowns merge algorithms, I've read a lot... but I didn't find an answer. Trying to find an optimal sorting algorithm, I came to the conclusion that the optimal merge is a generalization of the binary search algorithm. Someone thinks that may be true, or even already known? I've writen in ADA this algorithm and if someone finds the best known merge algorithm, I will benchmark my proof of concept against. Meanwhile, I would try to compare it to clasic merge.--[[User:Azrael60\|Azrael60]] 18:55, 26 September 2007 (UTC) 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)

Talk:Merge algorithm: Difference between revisions