| 
|
Quote: psort uses fewer comparisons than qsort; faster for sorted input, nearly sorted input, random input, and random binary
topics >
all references >
references c-d >
Topic:
sort algorithms
Quotation Skeleton
From Table II, one can easily see that … less than that required by BM qsort. On … , psort saves about a third of the … [p. 793] In all cases shown in Table IV, … [For sorted input on a Celeron, 2.44 vs. 21.13 sec, nearly sorted input 16.56 vs. 24.25 sec, random input 25.15 vs. 26.59 sec, random binary 6.38 vs. 7.26 sec.] Google-1 Google-2
Copyright clearance needed for quotation.
Topic: sort algorithms (24 items)