4 commits

Author	SHA1	Message	Date
Russ Cox	5aa7dc5daf	adopt suggestions from Bentley and McIlroy (SP&E Nov 1993) ... to make qsort more robust: * use "ninther" to choose pivot. * use three-way partition to avoid quadratic behavior on all-one-value arrays. also add tests suggested in that paper. the immediate cause of the slowness we observed was in fact none of these: the recursive call was sorting data[0:m] instead of data[a:m]. also rename package to "sort" to match convention. R=r,gri DELTA=358 (255 added, 21 deleted, 82 changed) OCL=19341 CL=19373	2008-11-17 11:51:34 -08:00
Robert Griesemer	0416f994b7	- added convenience wrappers for sort ... (work now with Ken's latest compiler fix) - exoanded test cases accordingly - fixed a type in the spec (thx r) R=r DELTA=65 (62 added, 2 deleted, 1 changed) OCL=15050 CL=15050	2008-09-09 18:13:08 -07:00
Robert Griesemer	ffbccb66c2	fixed sorting.go to use proper composite literal {}'s instead of ... "conversion" R=r OCL=14976 CL=14976	2008-09-08 18:50:35 -07:00
Robert Griesemer	18852cf6d3	- added sort package and test case ... R=r OCL=14975 CL=14975	2008-09-08 18:43:42 -07:00