On Wed, Dec 23, 2009 at 1:24 PM, Benson Margulies <bimargul...@gmail.com> wrote: > '4' was lame humor. Thanks for the concrete suggestion, I'll go there.
To be clearer about the lame joke: it's easy to test 'does it sort'. It's hard to test, 'does it correctly get implement this particular variation on quickSort which can be distinguished from others only by speed.' > > On Wed, Dec 23, 2009 at 1:03 PM, Jake Mannix <jake.man...@gmail.com> wrote: >> Er... four is a very small number. Can you use a fixed random seed to >> generate one >> nice big permutation of 1...n, and sort it, and verify that 1...n comes out >> in order? >> >> -jake >> >> On Wed, Dec 23, 2009 at 9:43 AM, Benson Margulies >> <bimargul...@gmail.com>wrote: >> >>> So, I'm staring at a file containing several copies of a very >>> carefully implemented versions of quickSort and mergeSort. >>> >>> I'd like to remove the deprecation. I can feed it 4 things out of >>> order and get them back sorted. Is that good enough? >>> >> >
