On July 23, 2003 09:48 pm, Ian Clarke wrote: > On Wed, Jul 23, 2003 at 09:45:32PM -0400, Ed Tomlinson wrote: > > My thoughts were that some nodes are really in trouble, routing to them > > should happen very very rarely. With QucikSelection we use the fact that > > quicksort is unstable to get a set of nodes that are the best n out of m > > nodes. Because of the instability of quicksort, normally the n nodes > > are in a random order. This let me simpify code and made the alg faster > > since we worked less to get the nodes. > > Perhaps, although I suspect that the time requirement to sort 50 values > is likely to be pretty inconsequential relative to other CPU demands.
It started out as a hashtable... now its a much faster array. Probably you are right - now. Ed _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
