> sort xxx xxx 1000 10000 100000 500000 Ignoring invalid range 'xxx' Ignoring invalid run count 0 Using arrays of lengths [1000,10000,100000,500000] containing numbers in the range -1000-1000. Note that odd lengths will be increased by one for the 'median-of-3 killer' sequences used to test q uicksort. This means that if a length is odd, one of the arrays will actually have a length one grea ter than the rest. Generating 16 arrays................ done. Each of the 5 algorithms will run 5 times over 4 arrays of each length, for a total of 80 passes for each algorithm, for a total of 400 passes globally. Built-in sort (UNFAIR: DOESN'T CALL FUNCTION FOR COMPARISON).... .... .... .... .... 1000: 1 1 2 | 1 0 2 | 0 0 0 | 1 1 1 10000: 20 20 21 | 14 14 14 | 13 13 13 | 23 23 23 100000: 256 247 278 | 161 157 171 | 161 155 174 | 336 330 351 500000: 1427 1406 1438 | 933 929 939 | 936 902 980 | 2088 2058 2113 Tango sort.... .... .... .... .... 1000: 1 1 1 | 20 20 21 | 24 24 26 | 0 9218868437227405312 0 10000: 17 16 18 | 491 485 496 | 631 600 670 | 0 9218868437227405312 0 100000: 173 171 179 | 5992 5916 6044 | 6532 6511 6554 | 0 9218868437227405312 0 500000: 938 889 1022 | 30625 30543 30827 | 33948 33799 34056 | 0 9218868437227405312 0 Introspective sort.... .... .... .... .... 1000: 1 1 1 | 0 0 0 | 0 0 0 | 1 0 1 10000: 23 21 31 | 6 4 7 | 6 4 7 | 20 14 23 100000: 201 184 233 | 83 72 115 | 92 70 117 | 267 228 309 500000: 1098 1041 1140 | 497 451 566 | 569 449 697 | 1588 1469 1807 Fast sort by leonardo maffi (UNFAIR like built-in).... .... .... .... .... 1000: 1 0 4 | 0 0 0 | 0 0 0 | 0 0 0 10000: 7 7 7 | 3 3 3 | 3 2 5 | 5 4 9 100000: 88 79 105 | 38 33 57 | 36 32 50 | 60 58 63 500000: 462 443 482 | 211 205 220 | 187 184 191 | 440 420 457 Fast sort by leonardo maffi.... .... .... .... .... 1000: 1 1 1 | 3 2 7 | 2 2 2 | 2 2 2 10000: 20 19 24 | 61 58 65 | 68 68 70 | 45 39 65 100000: 243 238 254 | 1781 1713 1868 | 2129 2072 2194 | 1158 1081 1367 500000: 1299 1251 1425 | 17011 16702 17364 | 18341 18229 18455 | 10691 10582 10812