Content deleted Content added
m →Sample code: unreferenced? |
No edit summary |
||
Line 79:
I intend to remove the sample implementations section if and when [[:Wikipedia:Articles for deletion/Insertion sort implementations]] is successful. It may be worthwhile to transwiki them to WikiBooks, WikiSource, or the Literate Programming wiki if anyone feels strongly about them. —<tt>[[User:donhalcon|donhalcon]]</tt><sup>[[User talk:donhalcon|╤]]</sup> 06:09, 5 March 2006 (UTC)
: That AFD was successful, but there are still a couple of sample implementations. What's going on with requiring references for sample code in articles? -- [[User:Mikeblas|Mikeblas]] 15:43, 5 September 2007 (UTC)
==BEST KNOWN MERGE ALGORITHM==
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)
| |||