Logged In: YES 
user_id=31435

New doc file, with an intro at the start and a program at the 
end.  Turns out that merge4.patch actually reversed the 
random-array #-of-comparisons advantage samplesort had 
enjoyed:  it's now timsort that does 1-2% fewer 
comparisons on random arrays of random lengths.

See the end of the file for why samplesort does 50% more 
comparisons on average for random arrays of length two 
<wink>.

Near the end of the new Intro section at the start, I suggest 
a couple experiments people might try on boxes where 
~sort is much slower under timsort.  That remains baffling, 
but the algorithm doesn't *do* much in that case, so 
someone on a box where it flounders could surely figure out 
why.