ocr: Size of list to be sorted (in thousands). 2 4 8 16 32 Time Function Algorithm 1, full scans, no optimization. 4.17 17.03 67.95 277.60 878-9721+4.445n" Algorithm 2, decreasing scans, no optimization. 2.14 8.57 34.50 136.65 -265+-245n+211n Algorithm 2, decreasing scans, optimized. .88 3.57 14,12 56.58 235.79 941-672n+.959n" Algorithm 3, a version of Shell sort, optimized. .22 .55 1.21 3.57 8.90 23.40 .210n 1351 Algorithm 4, Quicksort from the C library. .06 .16 .28 .61 1.26 2.69 149+.178nlogan
(.png)
