summaryrefslogtreecommitdiff
path: root/test/sorting.go
AgeCommit message (Collapse)AuthorFilesLines
2008-11-24convert tests.Russ Cox1-277/+0
refine gotest's test selection criteria. R=r DELTA=1590 (745 added, 844 deleted, 1 changed) OCL=19903 CL=19936
2008-11-19- adjust sort.go to use new naming conventionsRobert Griesemer1-3/+3
R=rsc DELTA=31 (0 added, 0 deleted, 31 changed) OCL=19618 CL=19620
2008-11-17adopt suggestions from Bentley and McIlroy (SP&E Nov 1993)Russ Cox1-30/+195
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-09-09- added convenience wrappers for sortRobert Griesemer1-0/+50
(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-08fixed sorting.go to use proper composite literal {}'s instead ofRobert Griesemer1-3/+3
"conversion" R=r OCL=14976 CL=14976
2008-09-08- added sort package and test caseRobert Griesemer1-0/+62
R=r OCL=14975 CL=14975