Author: Dann Corbit
Date: 10:28:42 10/20/99
Go up one level in this thread
Interestingly, I may have found something even faster for "microscopic" partitions: Merge exchange sorting. Average case performance is 2.875*N*log2(N)*log2(N). When N is very small, that expression looks very good. (see chart on p 382 of reference below) Donald Knuth, "The Art of Computer Programming, Vol 3 - Sorting and Searching", 1998, pp 110-113. At least it looks good on paper for tiny data sets. I have written an implementation and am going to test it today to see if it works "as advertized."
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.