run: *** 2-element array to be sorted *** 2 879 Sorting Array[2] 2 879 comps(2) = 1 N*(N-1)/2 = 1 shifts(2) = 1 The largest stack was 2 Sorting ReversedArray[2] 2 879 accumulated comps(2) = 2 accumulated shifts(2) = 4 The largest stack was 2 2 * Theoretic average number of comps over all arrays of size 2 for QuickSort = 1.2399999999999984 *** 3-element array to be sorted *** 2 879 621 Sorting Array[3] 2 621 879 comps(3) = 3 N*(N-1)/2 = 3 shifts(3) = 4 The largest stack was 3 Sorting ReversedArray[3] 2 621 879 accumulated comps(3) = 5 accumulated shifts(3) = 7 The largest stack was 3 2 * Theoretic average number of comps over all arrays of size 3 for QuickSort = 4.8060642079961795 *** 4-element array to be sorted *** 2 879 621 229 Sorting Array[4] 2 229 621 879 comps(4) = 6 N*(N-1)/2 = 6 shifts(4) = 9 The largest stack was 4 Sorting ReversedArray[4] 2 229 621 879 accumulated comps(4) = 10 accumulated shifts(4) = 15 The largest stack was 4 2 * Theoretic average number of comps over all arrays of size 4 for QuickSort = 9.259999999999998 *** 5-element array to be sorted *** 2 879 621 229 702 Sorting Array[5] 2 229 621 702 879 comps(5) = 9 N*(N-1)/2 = 10 shifts(5) = 11 The largest stack was 4 Sorting ReversedArray[5] 2 229 621 702 879 accumulated comps(5) = 15 accumulated shifts(5) = 21 The largest stack was 4 2 * Theoretic average number of comps over all arrays of size 5 for QuickSort = 14.466308074166605 *** 6-element array to be sorted *** 2 879 621 229 702 40 Sorting Array[6] 2 40 229 621 702 879 comps(6) = 13 N*(N-1)/2 = 15 shifts(6) = 18 The largest stack was 5 Sorting ReversedArray[6] 2 40 229 621 702 879 accumulated comps(6) = 24 accumulated shifts(6) = 26 The largest stack was 5 2 * Theoretic average number of comps over all arrays of size 6 for QuickSort = 20.314612363993312 *** 7-element array to be sorted *** 2 879 621 229 702 40 243 Sorting Array[7] 2 40 229 243 621 702 879 comps(7) = 17 N*(N-1)/2 = 21 shifts(7) = 22 The largest stack was 5 Sorting ReversedArray[7] 2 40 229 243 621 702 879 accumulated comps(7) = 28 accumulated shifts(7) = 36 The largest stack was 5 2 * Theoretic average number of comps over all arrays of size 7 for QuickSort = 26.719902751549427 *** 8-element array to be sorted *** 2 879 621 229 702 40 243 312 Sorting Array[8] 2 40 229 243 312 621 702 879 comps(8) = 22 N*(N-1)/2 = 28 shifts(8) = 27 The largest stack was 6 Sorting ReversedArray[8] 2 40 229 243 312 621 702 879 accumulated comps(8) = 37 accumulated shifts(8) = 50 The largest stack was 6 2 * Theoretic average number of comps over all arrays of size 8 for QuickSort = 33.61599999999999 *** 9-element array to be sorted *** 2 879 621 229 702 40 243 312 247 Sorting Array[9] 2 40 229 243 247 312 621 702 879 comps(9) = 28 N*(N-1)/2 = 36 shifts(9) = 34 The largest stack was 7 Sorting ReversedArray[9] 2 40 229 243 247 312 621 702 879 accumulated comps(9) = 47 accumulated shifts(9) = 58 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 9 for QuickSort = 40.950321039980906 *** 10-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 Sorting Array[10] 2 40 46 229 243 247 312 621 702 879 comps(10) = 33 N*(N-1)/2 = 45 shifts(10) = 45 The largest stack was 7 Sorting ReversedArray[10] 2 40 46 229 243 247 312 621 702 879 accumulated comps(10) = 56 accumulated shifts(10) = 67 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 10 for QuickSort = 48.68023146930545 *** 11-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 Sorting Array[11] 2 40 46 229 243 247 312 621 702 711 879 comps(11) = 37 N*(N-1)/2 = 55 shifts(11) = 48 The largest stack was 7 Sorting ReversedArray[11] 2 40 46 229 243 247 312 621 702 711 879 accumulated comps(11) = 67 accumulated shifts(11) = 89 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 11 for QuickSort = 56.77053336235106 *** 12-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 Sorting Array[12] 2 40 46 229 241 243 247 312 621 702 711 879 comps(12) = 44 N*(N-1)/2 = 66 shifts(12) = 61 The largest stack was 8 Sorting ReversedArray[12] 2 40 46 229 241 243 247 312 621 702 711 879 accumulated comps(12) = 76 accumulated shifts(12) = 99 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 12 for QuickSort = 65.19170867598757 *** 13-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 Sorting Array[13] 2 40 46 229 241 243 247 312 621 637 702 711 879 comps(13) = 49 N*(N-1)/2 = 78 shifts(13) = 68 The largest stack was 8 Sorting ReversedArray[13] 2 40 46 229 241 243 247 312 621 637 702 711 879 accumulated comps(13) = 80 accumulated shifts(13) = 114 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 13 for QuickSort = 73.91866458161948 *** 14-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 Sorting Array[14] 2 40 46 229 241 243 247 312 621 637 702 711 879 898 comps(14) = 51 N*(N-1)/2 = 91 shifts(14) = 68 The largest stack was 8 Sorting ReversedArray[14] 2 40 46 229 241 243 247 312 621 637 702 711 879 898 accumulated comps(14) = 95 accumulated shifts(14) = 141 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 14 for QuickSort = 82.92981765915516 *** 15-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 Sorting Array[15] 2 24 40 46 229 241 243 247 312 621 637 702 711 879 898 comps(15) = 53 N*(N-1)/2 = 105 shifts(15) = 64 The largest stack was 7 Sorting ReversedArray[15] 2 24 40 46 229 241 243 247 312 621 637 702 711 879 898 accumulated comps(15) = 98 accumulated shifts(15) = 101 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 15 for QuickSort = 92.206411696429 *** 16-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 Sorting Array[16] 2 15 24 40 46 229 241 243 247 312 621 637 702 711 879 898 comps(16) = 60 N*(N-1)/2 = 120 shifts(16) = 74 The largest stack was 7 Sorting ReversedArray[16] 2 15 24 40 46 229 241 243 247 312 621 637 702 711 879 898 accumulated comps(16) = 119 accumulated shifts(16) = 150 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 16 for QuickSort = 101.73199999999997 *** 17-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 Sorting Array[17] 2 15 24 40 46 229 241 243 247 312 621 637 702 711 872 879 898 comps(17) = 65 N*(N-1)/2 = 136 shifts(17) = 76 The largest stack was 7 Sorting ReversedArray[17] 2 15 24 40 46 229 241 243 247 312 621 637 702 711 872 879 898 accumulated comps(17) = 123 accumulated shifts(17) = 152 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 17 for QuickSort = 111.49204592702691 *** 18-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 Sorting Array[18] 2 15 24 40 46 229 241 243 247 312 595 621 637 702 711 872 879 898 comps(18) = 70 N*(N-1)/2 = 153 shifts(18) = 84 The largest stack was 7 Sorting ReversedArray[18] 2 15 24 40 46 229 241 243 247 312 595 621 637 702 711 872 879 898 accumulated comps(18) = 121 accumulated shifts(18) = 151 The largest stack was 7 2 * Theoretic average number of comps over all arrays of size 18 for QuickSort = 121.47360997596371 *** 19-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 Sorting Array[19] 2 15 24 40 46 182 229 241 243 247 312 595 621 637 702 711 872 879 898 comps(19) = 78 N*(N-1)/2 = 171 shifts(19) = 92 The largest stack was 8 Sorting ReversedArray[19] 2 15 24 40 46 182 229 241 243 247 312 595 621 637 702 711 872 879 898 accumulated comps(19) = 138 accumulated shifts(19) = 141 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 19 for QuickSort = 131.66510134531237 *** 20-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 Sorting Array[20] 2 15 24 40 46 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 comps(20) = 83 N*(N-1)/2 = 190 shifts(20) = 97 The largest stack was 8 Sorting ReversedArray[20] 2 15 24 40 46 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 accumulated comps(20) = 144 accumulated shifts(20) = 182 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 20 for QuickSort = 142.05607825958313 *** 21-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 Sorting Array[21] 2 15 24 40 46 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 comps(21) = 86 N*(N-1)/2 = 210 shifts(21) = 98 The largest stack was 8 Sorting ReversedArray[21] 2 15 24 40 46 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 accumulated comps(21) = 167 accumulated shifts(21) = 224 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 21 for QuickSort = 152.6370857107399 *** 22-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 Sorting Array[22] 2 15 24 40 46 137 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 comps(22) = 94 N*(N-1)/2 = 231 shifts(22) = 121 The largest stack was 8 Sorting ReversedArray[22] 2 15 24 40 46 137 182 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 accumulated comps(22) = 177 accumulated shifts(22) = 222 The largest stack was 8 2 * Theoretic average number of comps over all arrays of size 22 for QuickSort = 163.39952227783948 *** 23-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 Sorting Array[23] 2 15 24 40 46 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 comps(23) = 98 N*(N-1)/2 = 253 shifts(23) = 112 The largest stack was 8 Sorting ReversedArray[23] 2 15 24 40 46 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 accumulated comps(23) = 194 accumulated shifts(23) = 237 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 23 for QuickSort = 174.33552981256094 *** 24-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 Sorting Array[24] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 comps(24) = 109 N*(N-1)/2 = 276 shifts(24) = 134 The largest stack was 9 Sorting ReversedArray[24] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 898 953 accumulated comps(24) = 192 accumulated shifts(24) = 218 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 24 for QuickSort = 185.43790129997615 *** 25-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 Sorting Array[25] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 880 898 953 comps(25) = 113 N*(N-1)/2 = 300 shifts(25) = 139 The largest stack was 9 Sorting ReversedArray[25] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 595 621 635 637 702 711 872 879 880 898 953 accumulated comps(25) = 223 accumulated shifts(25) = 269 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 25 for QuickSort = 196.70000330944384 *** 26-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 Sorting Array[26] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 525 595 621 635 637 702 711 872 879 880 898 953 comps(26) = 120 N*(N-1)/2 = 325 shifts(26) = 136 The largest stack was 9 Sorting ReversedArray[26] 2 15 24 40 46 100 137 182 186 229 241 243 247 312 525 595 621 635 637 702 711 872 879 880 898 953 accumulated comps(26) = 206 accumulated shifts(26) = 237 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 26 for QuickSort = 208.11571026455186 *** 27-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 Sorting Array[27] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 525 595 621 635 637 702 711 872 879 880 898 953 comps(27) = 122 N*(N-1)/2 = 351 shifts(27) = 143 The largest stack was 9 Sorting ReversedArray[27] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 525 595 621 635 637 702 711 872 879 880 898 953 accumulated comps(27) = 227 accumulated shifts(27) = 247 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 27 for QuickSort = 219.6793483679198 *** 28-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 Sorting Array[28] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 702 711 872 879 880 898 953 comps(28) = 131 N*(N-1)/2 = 378 shifts(28) = 159 The largest stack was 9 Sorting ReversedArray[28] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 702 711 872 879 880 898 953 accumulated comps(28) = 225 accumulated shifts(28) = 267 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 28 for QuickSort = 231.3856474743666 *** 29-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 Sorting Array[29] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 872 879 880 898 953 comps(29) = 137 N*(N-1)/2 = 406 shifts(29) = 163 The largest stack was 9 Sorting ReversedArray[29] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 872 879 880 898 953 accumulated comps(29) = 247 accumulated shifts(29) = 318 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 29 for QuickSort = 243.2296995548089 *** 30-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 Sorting Array[30] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 758 872 879 880 898 953 comps(30) = 144 N*(N-1)/2 = 435 shifts(30) = 168 The largest stack was 9 Sorting ReversedArray[30] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 758 872 879 880 898 953 accumulated comps(30) = 273 accumulated shifts(30) = 360 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 30 for QuickSort = 255.2069226618312 *** 31-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 Sorting Array[31] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 729 758 872 879 880 898 953 comps(31) = 151 N*(N-1)/2 = 465 shifts(31) = 179 The largest stack was 9 Sorting ReversedArray[31] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 595 621 635 637 651 702 711 729 758 872 879 880 898 953 accumulated comps(31) = 281 accumulated shifts(31) = 372 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 31 for QuickSort = 267.3130295165574 *** 32-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 Sorting Array[32] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 566 595 621 635 637 651 702 711 729 758 872 879 880 898 953 comps(32) = 154 N*(N-1)/2 = 496 shifts(32) = 166 The largest stack was 9 Sorting ReversedArray[32] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 312 410 525 566 595 621 635 637 651 702 711 729 758 872 879 880 898 953 accumulated comps(32) = 288 accumulated shifts(32) = 348 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 32 for QuickSort = 279.544 *** 33-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 Sorting Array[33] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 312 410 525 566 595 621 635 637 651 702 711 729 758 872 879 880 898 953 comps(33) = 165 N*(N-1)/2 = 528 shifts(33) = 187 The largest stack was 10 Sorting ReversedArray[33] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 312 410 525 566 595 621 635 637 651 702 711 729 758 872 879 880 898 953 accumulated comps(33) = 294 accumulated shifts(33) = 323 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 33 for QuickSort = 291.89605696129547 *** 34-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 Sorting Array[34] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 312 410 525 566 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 comps(34) = 172 N*(N-1)/2 = 561 shifts(34) = 196 The largest stack was 10 Sorting ReversedArray[34] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 312 410 525 566 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 accumulated comps(34) = 317 accumulated shifts(34) = 398 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 34 for QuickSort = 304.36564485810794 *** 35-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 Sorting Array[35] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 comps(35) = 181 N*(N-1)/2 = 595 shifts(35) = 180 The largest stack was 9 Sorting ReversedArray[35] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 accumulated comps(35) = 321 accumulated shifts(35) = 367 The largest stack was 9 2 * Theoretic average number of comps over all arrays of size 35 for QuickSort = 316.949410826972 *** 36-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 Sorting Array[36] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 comps(36) = 187 N*(N-1)/2 = 630 shifts(36) = 204 The largest stack was 10 Sorting ReversedArray[36] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 758 836 872 879 880 898 953 accumulated comps(36) = 348 accumulated shifts(36) = 406 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 36 for QuickSort = 329.6441878479292 *** 37-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 Sorting Array[37] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 731 758 836 872 879 880 898 953 comps(37) = 195 N*(N-1)/2 = 666 shifts(37) = 215 The largest stack was 10 Sorting ReversedArray[37] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 731 758 836 872 879 880 898 953 accumulated comps(37) = 361 accumulated shifts(37) = 464 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 37 for QuickSort = 342.446979721891 *** 38-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 Sorting Array[38] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 731 758 760 836 872 879 880 898 953 comps(38) = 201 N*(N-1)/2 = 703 shifts(38) = 217 The largest stack was 10 Sorting ReversedArray[38] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 702 711 729 731 758 760 836 872 879 880 898 953 accumulated comps(38) = 393 accumulated shifts(38) = 527 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 38 for QuickSort = 355.354947623359 *** 39-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 Sorting Array[39] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 comps(39) = 203 N*(N-1)/2 = 741 shifts(39) = 209 The largest stack was 10 Sorting ReversedArray[39] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 accumulated comps(39) = 394 accumulated shifts(39) = 480 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 39 for QuickSort = 368.36539802744613 *** 40-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 Sorting Array[40] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 comps(40) = 220 N*(N-1)/2 = 780 shifts(40) = 237 The largest stack was 10 Sorting ReversedArray[40] 2 15 24 35 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 accumulated comps(40) = 447 accumulated shifts(40) = 508 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 40 for QuickSort = 381.4757718401384 *** 41-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 Sorting Array[41] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 comps(41) = 221 N*(N-1)/2 = 820 shifts(41) = 249 The largest stack was 10 Sorting ReversedArray[41] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 accumulated comps(41) = 427 accumulated shifts(41) = 463 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 41 for QuickSort = 394.68363458565574 *** 42-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 Sorting Array[42] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 comps(42) = 227 N*(N-1)/2 = 861 shifts(42) = 243 The largest stack was 10 Sorting ReversedArray[42] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 898 953 accumulated comps(42) = 421 accumulated shifts(42) = 435 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 42 for QuickSort = 407.98666752553714 *** 43-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 Sorting Array[43] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 comps(43) = 232 N*(N-1)/2 = 903 shifts(43) = 248 The largest stack was 10 Sorting ReversedArray[43] 2 15 24 35 39 40 46 100 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 accumulated comps(43) = 449 accumulated shifts(43) = 527 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 43 for QuickSort = 421.38265960150545 *** 44-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 Sorting Array[44] 2 15 24 35 39 40 46 100 106 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 comps(44) = 244 N*(N-1)/2 = 946 shifts(44) = 281 The largest stack was 10 Sorting ReversedArray[44] 2 15 24 35 39 40 46 100 106 137 182 186 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 accumulated comps(44) = 474 accumulated shifts(44) = 437 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 44 for QuickSort = 434.8695001088164 *** 45-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 Sorting Array[45] 2 15 24 35 39 40 46 100 106 137 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 comps(45) = 247 N*(N-1)/2 = 990 shifts(45) = 246 The largest stack was 11 Sorting ReversedArray[45] 2 15 24 35 39 40 46 100 106 137 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 accumulated comps(45) = 440 accumulated shifts(45) = 422 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 45 for QuickSort = 448.4451720191894 *** 46-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 Sorting Array[46] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 comps(46) = 251 N*(N-1)/2 = 1035 shifts(46) = 291 The largest stack was 9 Sorting ReversedArray[46] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 accumulated comps(46) = 495 accumulated shifts(46) = 472 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 46 for QuickSort = 462.1077458829318 *** 47-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 Sorting Array[47] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 comps(47) = 255 N*(N-1)/2 = 1081 shifts(47) = 291 The largest stack was 9 Sorting ReversedArray[47] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 accumulated comps(47) = 545 accumulated shifts(47) = 565 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 47 for QuickSort = 475.85537424881966 *** 48-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 Sorting Array[48] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 comps(48) = 266 N*(N-1)/2 = 1128 shifts(48) = 307 The largest stack was 10 Sorting ReversedArray[48] 2 15 24 35 39 40 46 100 106 137 144 182 186 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 accumulated comps(48) = 485 accumulated shifts(48) = 594 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 48 for QuickSort = 489.6862865479533 *** 49-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 Sorting Array[49] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 comps(49) = 274 N*(N-1)/2 = 1176 shifts(49) = 314 The largest stack was 10 Sorting ReversedArray[49] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 accumulated comps(49) = 581 accumulated shifts(49) = 574 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 49 for QuickSort = 503.59878439436784 *** 50-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 Sorting Array[50] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 comps(50) = 286 N*(N-1)/2 = 1225 shifts(50) = 313 The largest stack was 10 Sorting ReversedArray[50] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 885 898 953 961 accumulated comps(50) = 523 accumulated shifts(50) = 587 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 50 for QuickSort = 517.5912372608323 *** 51-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 Sorting Array[51] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 comps(51) = 291 N*(N-1)/2 = 1275 shifts(51) = 316 The largest stack was 10 Sorting ReversedArray[51] 2 15 24 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 accumulated comps(51) = 555 accumulated shifts(51) = 698 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 51 for QuickSort = 531.6620784931391 *** 52-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 Sorting Array[52] 2 15 24 25 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 comps(52) = 289 N*(N-1)/2 = 1326 shifts(52) = 334 The largest stack was 11 Sorting ReversedArray[52] 2 15 24 25 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 accumulated comps(52) = 551 accumulated shifts(52) = 599 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 52 for QuickSort = 545.8098016304167 *** 53-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 Sorting Array[53] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 comps(53) = 303 N*(N-1)/2 = 1378 shifts(53) = 347 The largest stack was 10 Sorting ReversedArray[53] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 953 961 accumulated comps(53) = 569 accumulated shifts(53) = 621 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 53 for QuickSort = 560.0329570026561 *** 54-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 Sorting Array[54] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(54) = 308 N*(N-1)/2 = 1431 shifts(54) = 350 The largest stack was 10 Sorting ReversedArray[54] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(54) = 621 accumulated shifts(54) = 695 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 54 for QuickSort = 574.3301485798424 *** 55-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 Sorting Array[55] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(55) = 319 N*(N-1)/2 = 1485 shifts(55) = 368 The largest stack was 10 Sorting ReversedArray[55] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(55) = 591 accumulated shifts(55) = 617 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 55 for QuickSort = 588.70003104986 *** 56-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 Sorting Array[56] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(56) = 319 N*(N-1)/2 = 1540 shifts(56) = 340 The largest stack was 10 Sorting ReversedArray[56] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(56) = 604 accumulated shifts(56) = 593 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 56 for QuickSort = 603.1413071047896 *** 57-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 Sorting Array[57] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(57) = 329 N*(N-1)/2 = 1596 shifts(57) = 347 The largest stack was 10 Sorting ReversedArray[57] 2 15 24 25 34 35 39 40 46 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(57) = 598 accumulated shifts(57) = 691 The largest stack was 10 2 * Theoretic average number of comps over all arrays of size 57 for QuickSort = 617.6527249173505 *** 58-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 Sorting Array[58] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(58) = 337 N*(N-1)/2 = 1653 shifts(58) = 356 The largest stack was 12 Sorting ReversedArray[58] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(58) = 637 accumulated shifts(58) = 660 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 58 for QuickSort = 632.2330757911241 *** 59-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 Sorting Array[59] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 260 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(59) = 346 N*(N-1)/2 = 1711 shifts(59) = 365 The largest stack was 12 Sorting ReversedArray[59] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 260 268 269 312 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(59) = 647 accumulated shifts(59) = 639 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 59 for QuickSort = 646.8811919698614 *** 60-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 Sorting Array[60] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(60) = 363 N*(N-1)/2 = 1770 shifts(60) = 389 The largest stack was 12 Sorting ReversedArray[60] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(60) = 690 accumulated shifts(60) = 767 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 60 for QuickSort = 661.5959445926355 *** 61-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 Sorting Array[61] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(61) = 367 N*(N-1)/2 = 1830 shifts(61) = 370 The largest stack was 12 Sorting ReversedArray[61] 2 15 24 25 34 35 39 40 46 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(61) = 651 accumulated shifts(61) = 676 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 61 for QuickSort = 676.3762417829079 *** 62-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 Sorting Array[62] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(62) = 393 N*(N-1)/2 = 1891 shifts(62) = 420 The largest stack was 11 Sorting ReversedArray[62] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(62) = 711 accumulated shifts(62) = 693 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 62 for QuickSort = 691.2210268607223 *** 63-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 Sorting Array[63] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(63) = 399 N*(N-1)/2 = 1953 shifts(63) = 438 The largest stack was 11 Sorting ReversedArray[63] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(63) = 759 accumulated shifts(63) = 883 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 63 for QuickSort = 706.1292766682732 *** 64-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 Sorting Array[64] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(64) = 406 N*(N-1)/2 = 2016 shifts(64) = 440 The largest stack was 12 Sorting ReversedArray[64] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(64) = 708 accumulated shifts(64) = 727 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 64 for QuickSort = 721.0999999999999 *** 65-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 Sorting Array[65] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 comps(65) = 414 N*(N-1)/2 = 2080 shifts(65) = 454 The largest stack was 12 Sorting ReversedArray[65] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 898 909 953 961 accumulated comps(65) = 751 accumulated shifts(65) = 837 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 65 for QuickSort = 736.1322361291818 *** 66-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 Sorting Array[66] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 comps(66) = 417 N*(N-1)/2 = 2145 shifts(66) = 457 The largest stack was 12 Sorting ReversedArray[66] 2 15 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 accumulated comps(66) = 785 accumulated shifts(66) = 902 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 66 for QuickSort = 751.2250534237294 *** 67-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 Sorting Array[67] 2 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 comps(67) = 430 N*(N-1)/2 = 2211 shifts(67) = 474 The largest stack was 12 Sorting ReversedArray[67] 2 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 accumulated comps(67) = 832 accumulated shifts(67) = 867 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 67 for QuickSort = 766.3775480445281 *** 68-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 Sorting Array[68] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 comps(68) = 417 N*(N-1)/2 = 2278 shifts(68) = 478 The largest stack was 11 Sorting ReversedArray[68] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 872 879 880 882 885 897 898 909 953 961 accumulated comps(68) = 853 accumulated shifts(68) = 927 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 68 for QuickSort = 781.5888427202699 *** 69-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 Sorting Array[69] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 comps(69) = 423 N*(N-1)/2 = 2346 shifts(69) = 479 The largest stack was 11 Sorting ReversedArray[69] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 accumulated comps(69) = 841 accumulated shifts(69) = 891 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 69 for QuickSort = 796.858085593236 *** 70-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 Sorting Array[70] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 comps(70) = 432 N*(N-1)/2 = 2415 shifts(70) = 465 The largest stack was 11 Sorting ReversedArray[70] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 accumulated comps(70) = 807 accumulated shifts(70) = 843 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 70 for QuickSort = 812.1844491309728 *** 71-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 Sorting Array[71] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 comps(71) = 461 N*(N-1)/2 = 2485 shifts(71) = 484 The largest stack was 12 Sorting ReversedArray[71] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 accumulated comps(71) = 891 accumulated shifts(71) = 1020 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 71 for QuickSort = 827.5671290992223 *** 72-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 Sorting Array[72] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 comps(72) = 453 N*(N-1)/2 = 2556 shifts(72) = 505 The largest stack was 11 Sorting ReversedArray[72] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 953 961 accumulated comps(72) = 830 accumulated shifts(72) = 940 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 72 for QuickSort = 843.0053435918603 *** 73-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 Sorting Array[73] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 comps(73) = 460 N*(N-1)/2 = 2628 shifts(73) = 510 The largest stack was 11 Sorting ReversedArray[73] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(73) = 943 accumulated shifts(73) = 1188 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 73 for QuickSort = 858.49833211394 *** 74-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 Sorting Array[74] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 116 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 comps(74) = 477 N*(N-1)/2 = 2701 shifts(74) = 505 The largest stack was 11 Sorting ReversedArray[74] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 116 137 144 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(74) = 875 accumulated shifts(74) = 901 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 74 for QuickSort = 874.0453547142588 *** 75-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 Sorting Array[75] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 comps(75) = 487 N*(N-1)/2 = 2775 shifts(75) = 528 The largest stack was 13 Sorting ReversedArray[75] 2 10 15 21 24 25 34 35 39 40 46 55 59 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(75) = 999 accumulated shifts(75) = 1108 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 75 for QuickSort = 889.645691164148 *** 76-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 Sorting Array[76] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 comps(76) = 477 N*(N-1)/2 = 2850 shifts(76) = 561 The largest stack was 11 Sorting ReversedArray[76] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(76) = 975 accumulated shifts(76) = 1049 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 76 for QuickSort = 905.2986401794527 *** 77-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 Sorting Array[77] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(77) = 478 N*(N-1)/2 = 2926 shifts(77) = 549 The largest stack was 11 Sorting ReversedArray[77] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(77) = 920 accumulated shifts(77) = 1039 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 77 for QuickSort = 921.0035186828887 *** 78-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 Sorting Array[78] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(78) = 497 N*(N-1)/2 = 3003 shifts(78) = 538 The largest stack was 12 Sorting ReversedArray[78] 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(78) = 920 accumulated shifts(78) = 1054 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 78 for QuickSort = 936.759661104206 *** 79-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 Sorting Array[79] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(79) = 478 N*(N-1)/2 = 3081 shifts(79) = 481 The largest stack was 13 Sorting ReversedArray[79] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(79) = 979 accumulated shifts(79) = 998 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 79 for QuickSort = 952.5664187157544 *** 80-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 Sorting Array[80] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(80) = 467 N*(N-1)/2 = 3160 shifts(80) = 417 The largest stack was 11 Sorting ReversedArray[80] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(80) = 947 accumulated shifts(80) = 922 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 80 for QuickSort = 968.423159001249 *** 81-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 Sorting Array[81] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(81) = 474 N*(N-1)/2 = 3240 shifts(81) = 435 The largest stack was 11 Sorting ReversedArray[81] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 702 711 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(81) = 921 accumulated shifts(81) = 966 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 81 for QuickSort = 984.3292650556867 *** 82-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 Sorting Array[82] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(82) = 484 N*(N-1)/2 = 3321 shifts(82) = 447 The largest stack was 11 Sorting ReversedArray[82] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(82) = 989 accumulated shifts(82) = 1073 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 82 for QuickSort = 1000.2841350145103 *** 83-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 Sorting Array[83] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(83) = 487 N*(N-1)/2 = 3403 shifts(83) = 453 The largest stack was 11 Sorting ReversedArray[83] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(83) = 976 accumulated shifts(83) = 1099 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 83 for QuickSort = 1016.2871815102689 *** 84-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 Sorting Array[84] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(84) = 525 N*(N-1)/2 = 3486 shifts(84) = 506 The largest stack was 13 Sorting ReversedArray[84] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(84) = 1021 accumulated shifts(84) = 1068 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 84 for QuickSort = 1032.337831155131 *** 85-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 Sorting Array[85] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(85) = 531 N*(N-1)/2 = 3570 shifts(85) = 452 The largest stack was 12 Sorting ReversedArray[85] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(85) = 1024 accumulated shifts(85) = 958 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 85 for QuickSort = 1048.4355240477391 *** 86-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 Sorting Array[86] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(86) = 535 N*(N-1)/2 = 3655 shifts(86) = 443 The largest stack was 11 Sorting ReversedArray[86] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(86) = 1040 accumulated shifts(86) = 1063 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 86 for QuickSort = 1064.5797133029766 *** 87-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 Sorting Array[87] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(87) = 537 N*(N-1)/2 = 3741 shifts(87) = 487 The largest stack was 11 Sorting ReversedArray[87] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(87) = 1079 accumulated shifts(87) = 1050 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 87 for QuickSort = 1080.7698646033555 *** 88-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 Sorting Array[88] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(88) = 518 N*(N-1)/2 = 3828 shifts(88) = 488 The largest stack was 10 Sorting ReversedArray[88] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(88) = 1048 accumulated shifts(88) = 1074 The largest stack was 11 2 * Theoretic average number of comps over all arrays of size 88 for QuickSort = 1097.0054557707704 *** 89-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 Sorting Array[89] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 672 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(89) = 549 N*(N-1)/2 = 3916 shifts(89) = 493 The largest stack was 13 Sorting ReversedArray[89] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 672 685 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(89) = 1058 accumulated shifts(89) = 1101 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 89 for QuickSort = 1113.2859763574968 *** 90-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 Sorting Array[90] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(90) = 557 N*(N-1)/2 = 4005 shifts(90) = 499 The largest stack was 13 Sorting ReversedArray[90] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(90) = 1119 accumulated shifts(90) = 1275 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 90 for QuickSort = 1129.610927255353 *** 91-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 Sorting Array[91] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(91) = 546 N*(N-1)/2 = 4095 shifts(91) = 545 The largest stack was 10 Sorting ReversedArray[91] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(91) = 1117 accumulated shifts(91) = 1296 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 91 for QuickSort = 1145.979820322032 *** 92-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 Sorting Array[92] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 comps(92) = 549 N*(N-1)/2 = 4186 shifts(92) = 545 The largest stack was 10 Sorting ReversedArray[92] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 accumulated comps(92) = 1087 accumulated shifts(92) = 1146 The largest stack was 12 2 * Theoretic average number of comps over all arrays of size 92 for QuickSort = 1162.3921780236738 *** 93-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 Sorting Array[93] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(93) = 555 N*(N-1)/2 = 4278 shifts(93) = 545 The largest stack was 10 Sorting ReversedArray[93] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(93) = 1185 accumulated shifts(93) = 1331 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 93 for QuickSort = 1178.8475330927974 *** 94-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 Sorting Array[94] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(94) = 557 N*(N-1)/2 = 4371 shifts(94) = 521 The largest stack was 10 Sorting ReversedArray[94] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(94) = 1152 accumulated shifts(94) = 1211 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 94 for QuickSort = 1195.345428200789 *** 95-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 Sorting Array[95] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(95) = 568 N*(N-1)/2 = 4465 shifts(95) = 529 The largest stack was 10 Sorting ReversedArray[95] 1 2 10 15 21 24 25 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(95) = 1161 accumulated shifts(95) = 1339 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 95 for QuickSort = 1211.885415644165 *** 96-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 29 Sorting Array[96] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(96) = 628 N*(N-1)/2 = 4560 shifts(96) = 662 The largest stack was 13 Sorting ReversedArray[96] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 74 100 106 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(96) = 1215 accumulated shifts(96) = 1191 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 96 for QuickSort = 1228.467057043907 *** 97-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 29 112 Sorting Array[97] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(97) = 619 N*(N-1)/2 = 4656 shifts(97) = 643 The largest stack was 12 Sorting ReversedArray[97] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(97) = 1258 accumulated shifts(97) = 1319 The largest stack was 15 2 * Theoretic average number of comps over all arrays of size 97 for QuickSort = 1245.0899230571863 *** 98-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 29 112 62 Sorting Array[98] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 comps(98) = 620 N*(N-1)/2 = 4753 shifts(98) = 565 The largest stack was 12 Sorting ReversedArray[98] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(98) = 1254 accumulated shifts(98) = 1279 The largest stack was 15 2 * Theoretic average number of comps over all arrays of size 98 for QuickSort = 1261.7535931008485 *** 99-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 29 112 62 876 Sorting Array[99] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 876 879 880 882 885 897 898 909 935 953 961 969 comps(99) = 629 N*(N-1)/2 = 4851 shifts(99) = 564 The largest stack was 12 Sorting ReversedArray[99] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 876 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(99) = 1256 accumulated shifts(99) = 1306 The largest stack was 14 2 * Theoretic average number of comps over all arrays of size 99 for QuickSort = 1278.4576550860677 *** 100-element array to be sorted *** 2 879 621 229 702 40 243 312 247 46 711 241 637 898 24 15 872 595 182 635 953 137 186 100 880 525 35 410 651 758 729 566 268 836 269 567 731 760 654 414 39 529 885 106 192 144 961 643 191 604 882 25 34 909 648 253 724 59 260 327 258 55 718 246 639 897 21 10 864 584 169 619 935 116 162 74 851 493 1 374 612 716 685 520 219 784 215 511 672 698 590 347 969 457 810 29 112 62 876 556 Sorting Array[100] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 556 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 876 879 880 882 885 897 898 909 935 953 961 969 comps(100) = 692 N*(N-1)/2 = 4950 shifts(100) = 659 The largest stack was 13 Sorting ReversedArray[100] 1 2 10 15 21 24 25 29 34 35 39 40 46 55 59 62 74 100 106 112 116 137 144 162 169 182 186 191 192 215 219 229 241 243 246 247 253 258 260 268 269 312 327 347 374 410 414 457 493 511 520 525 529 556 566 567 584 590 595 604 612 619 621 635 637 639 643 648 651 654 672 685 698 702 711 716 718 724 729 731 758 760 784 810 836 851 864 872 876 879 880 882 885 897 898 909 935 953 961 969 accumulated comps(100) = 1299 accumulated shifts(100) = 1335 The largest stack was 13 2 * Theoretic average number of comps over all arrays of size 100 for QuickSort = 1295.2017051636092 BUILD SUCCESSFUL (total time: 0 seconds)