run: *** 2-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(2) = 3 >>> Theoretic accumulative number of comps in successful searches in an 2-element array = 3 Match! Avg = 1.5 Approximate low value of avg = 0.5849625007211563 Approximate high value of avg = 0.6849625007211563 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(2) = 5 >>> Theoretic accumulative number of comps in unsuccessful searches in an 2-element array = 5 Match! Avg = 1.6666666666666667 Approximate low value of avg = 1.5849625007211563 Approximate high value of avg = 1.6849625007211564 Fits in! Difference between the unsuccessful and successful = 0.16666666666666674 *** 3-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(3) = 5 >>> Theoretic accumulative number of comps in successful searches in an 3-element array = 5 Match! Avg = 1.6666666666666667 Approximate low value of avg = 1.0 Approximate high value of avg = 1.1 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(3) = 8 >>> Theoretic accumulative number of comps in unsuccessful searches in an 3-element array = 8 Match! Avg = 2.0 Approximate low value of avg = 2.0 Approximate high value of avg = 2.1 Fits in! Difference between the unsuccessful and successful = 0.33333333333333326 *** 4-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(4) = 8 >>> Theoretic accumulative number of comps in successful searches in an 4-element array = 8 Match! Avg = 2.0 Approximate low value of avg = 1.3219280948873622 Approximate high value of avg = 1.4219280948873623 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(4) = 12 >>> Theoretic accumulative number of comps in unsuccessful searches in an 4-element array = 12 Match! Avg = 2.4 Approximate low value of avg = 2.321928094887362 Approximate high value of avg = 2.4219280948873623 Fits in! Difference between the unsuccessful and successful = 0.3999999999999999 *** 5-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(5) = 11 >>> Theoretic accumulative number of comps in successful searches in an 5-element array = 11 Match! Avg = 2.2 Approximate low value of avg = 1.584962500721156 Approximate high value of avg = 1.6849625007211562 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(5) = 16 >>> Theoretic accumulative number of comps in unsuccessful searches in an 5-element array = 16 Match! Avg = 2.6666666666666665 Approximate low value of avg = 2.584962500721156 Approximate high value of avg = 2.684962500721156 Fits in! Difference between the unsuccessful and successful = 0.46666666666666634 *** 6-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(6) = 14 >>> Theoretic accumulative number of comps in successful searches in an 6-element array = 14 Match! Avg = 2.3333333333333335 Approximate low value of avg = 1.8073549220576042 Approximate high value of avg = 1.9073549220576043 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(6) = 20 >>> Theoretic accumulative number of comps in unsuccessful searches in an 6-element array = 20 Match! Avg = 2.857142857142857 Approximate low value of avg = 2.807354922057604 Approximate high value of avg = 2.9073549220576043 Fits in! Difference between the unsuccessful and successful = 0.5238095238095237 *** 7-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(7) = 17 >>> Theoretic accumulative number of comps in successful searches in an 7-element array = 17 Match! Avg = 2.4285714285714284 Approximate low value of avg = 2.0 Approximate high value of avg = 2.1 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(7) = 24 >>> Theoretic accumulative number of comps in unsuccessful searches in an 7-element array = 24 Match! Avg = 3.0 Approximate low value of avg = 3.0 Approximate high value of avg = 3.1 Fits in! Difference between the unsuccessful and successful = 0.5714285714285716 *** 8-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(8) = 21 >>> Theoretic accumulative number of comps in successful searches in an 8-element array = 21 Match! Avg = 2.625 Approximate low value of avg = 2.1699250014423126 Approximate high value of avg = 2.2699250014423127 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(8) = 29 >>> Theoretic accumulative number of comps in unsuccessful searches in an 8-element array = 29 Match! Avg = 3.2222222222222223 Approximate low value of avg = 3.1699250014423126 Approximate high value of avg = 3.2699250014423127 Fits in! Difference between the unsuccessful and successful = 0.5972222222222223 *** 9-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9) = 25 >>> Theoretic accumulative number of comps in successful searches in an 9-element array = 25 Match! Avg = 2.7777777777777777 Approximate low value of avg = 2.3219280948873626 Approximate high value of avg = 2.4219280948873627 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9) = 34 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9-element array = 34 Match! Avg = 3.4 Approximate low value of avg = 3.3219280948873626 Approximate high value of avg = 3.4219280948873627 Fits in! Difference between the unsuccessful and successful = 0.6222222222222222 *** 10-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(10) = 29 >>> Theoretic accumulative number of comps in successful searches in an 10-element array = 29 Match! Avg = 2.9 Approximate low value of avg = 2.4594316186372978 Approximate high value of avg = 2.559431618637298 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(10) = 39 >>> Theoretic accumulative number of comps in unsuccessful searches in an 10-element array = 39 Match! Avg = 3.5454545454545454 Approximate low value of avg = 3.4594316186372978 Approximate high value of avg = 3.559431618637298 Fits in! Difference between the unsuccessful and successful = 0.6454545454545455 *** 11-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(11) = 33 >>> Theoretic accumulative number of comps in successful searches in an 11-element array = 33 Match! Avg = 3.0 Approximate low value of avg = 2.5849625007211565 Approximate high value of avg = 2.6849625007211566 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(11) = 44 >>> Theoretic accumulative number of comps in unsuccessful searches in an 11-element array = 44 Match! Avg = 3.6666666666666665 Approximate low value of avg = 3.5849625007211565 Approximate high value of avg = 3.6849625007211566 Fits in! Difference between the unsuccessful and successful = 0.6666666666666665 *** 12-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(12) = 37 >>> Theoretic accumulative number of comps in successful searches in an 12-element array = 37 Match! Avg = 3.0833333333333335 Approximate low value of avg = 2.700439718141092 Approximate high value of avg = 2.8004397181410923 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(12) = 49 >>> Theoretic accumulative number of comps in unsuccessful searches in an 12-element array = 49 Match! Avg = 3.769230769230769 Approximate low value of avg = 3.700439718141092 Approximate high value of avg = 3.8004397181410923 Fits in! Difference between the unsuccessful and successful = 0.6858974358974357 *** 13-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(13) = 41 >>> Theoretic accumulative number of comps in successful searches in an 13-element array = 41 Match! Avg = 3.1538461538461537 Approximate low value of avg = 2.8073549220576037 Approximate high value of avg = 2.907354922057604 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(13) = 54 >>> Theoretic accumulative number of comps in unsuccessful searches in an 13-element array = 54 Match! Avg = 3.857142857142857 Approximate low value of avg = 3.8073549220576037 Approximate high value of avg = 3.907354922057604 Fits in! Difference between the unsuccessful and successful = 0.7032967032967035 *** 14-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(14) = 45 >>> Theoretic accumulative number of comps in successful searches in an 14-element array = 45 Match! Avg = 3.2142857142857144 Approximate low value of avg = 2.9068905956085187 Approximate high value of avg = 3.006890595608519 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(14) = 59 >>> Theoretic accumulative number of comps in unsuccessful searches in an 14-element array = 59 Match! Avg = 3.933333333333333 Approximate low value of avg = 3.9068905956085187 Approximate high value of avg = 4.006890595608518 Fits in! Difference between the unsuccessful and successful = 0.7190476190476187 *** 15-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(15) = 49 >>> Theoretic accumulative number of comps in successful searches in an 15-element array = 49 Match! Avg = 3.2666666666666666 Approximate low value of avg = 3.0 Approximate high value of avg = 3.1 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(15) = 64 >>> Theoretic accumulative number of comps in unsuccessful searches in an 15-element array = 64 Match! Avg = 4.0 Approximate low value of avg = 4.0 Approximate high value of avg = 4.1 Fits in! Difference between the unsuccessful and successful = 0.7333333333333334 *** 16-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(16) = 54 >>> Theoretic accumulative number of comps in successful searches in an 16-element array = 54 Match! Avg = 3.375 Approximate low value of avg = 3.08746284125034 Approximate high value of avg = 3.18746284125034 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(16) = 70 >>> Theoretic accumulative number of comps in unsuccessful searches in an 16-element array = 70 Match! Avg = 4.117647058823529 Approximate low value of avg = 4.08746284125034 Approximate high value of avg = 4.18746284125034 Fits in! Difference between the unsuccessful and successful = 0.742647058823529 *** 17-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(17) = 59 >>> Theoretic accumulative number of comps in successful searches in an 17-element array = 59 Match! Avg = 3.4705882352941178 Approximate low value of avg = 3.169925001442312 Approximate high value of avg = 3.2699250014423122 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(17) = 76 >>> Theoretic accumulative number of comps in unsuccessful searches in an 17-element array = 76 Match! Avg = 4.222222222222222 Approximate low value of avg = 4.169925001442312 Approximate high value of avg = 4.269925001442312 Fits in! Difference between the unsuccessful and successful = 0.7516339869281046 *** 18-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(18) = 64 >>> Theoretic accumulative number of comps in successful searches in an 18-element array = 64 Match! Avg = 3.5555555555555554 Approximate low value of avg = 3.247927513443585 Approximate high value of avg = 3.3479275134435853 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(18) = 82 >>> Theoretic accumulative number of comps in unsuccessful searches in an 18-element array = 82 Match! Avg = 4.315789473684211 Approximate low value of avg = 4.247927513443585 Approximate high value of avg = 4.347927513443585 Fits in! Difference between the unsuccessful and successful = 0.7602339181286553 *** 19-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(19) = 69 >>> Theoretic accumulative number of comps in successful searches in an 19-element array = 69 Match! Avg = 3.6315789473684212 Approximate low value of avg = 3.3219280948873626 Approximate high value of avg = 3.4219280948873627 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(19) = 88 >>> Theoretic accumulative number of comps in unsuccessful searches in an 19-element array = 88 Match! Avg = 4.4 Approximate low value of avg = 4.321928094887363 Approximate high value of avg = 4.421928094887362 Fits in! Difference between the unsuccessful and successful = 0.7684210526315791 *** 20-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(20) = 74 >>> Theoretic accumulative number of comps in successful searches in an 20-element array = 74 Match! Avg = 3.7 Approximate low value of avg = 3.3923174227787607 Approximate high value of avg = 3.492317422778761 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(20) = 94 >>> Theoretic accumulative number of comps in unsuccessful searches in an 20-element array = 94 Match! Avg = 4.476190476190476 Approximate low value of avg = 4.392317422778761 Approximate high value of avg = 4.49231742277876 Fits in! Difference between the unsuccessful and successful = 0.7761904761904761 *** 21-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(21) = 79 >>> Theoretic accumulative number of comps in successful searches in an 21-element array = 79 Match! Avg = 3.761904761904762 Approximate low value of avg = 3.4594316186372973 Approximate high value of avg = 3.5594316186372974 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(21) = 100 >>> Theoretic accumulative number of comps in unsuccessful searches in an 21-element array = 100 Match! Avg = 4.545454545454546 Approximate low value of avg = 4.459431618637297 Approximate high value of avg = 4.559431618637297 Fits in! Difference between the unsuccessful and successful = 0.783549783549784 *** 22-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(22) = 84 >>> Theoretic accumulative number of comps in successful searches in an 22-element array = 84 Match! Avg = 3.8181818181818183 Approximate low value of avg = 3.523561956057013 Approximate high value of avg = 3.623561956057013 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(22) = 106 >>> Theoretic accumulative number of comps in unsuccessful searches in an 22-element array = 106 Match! Avg = 4.608695652173913 Approximate low value of avg = 4.523561956057013 Approximate high value of avg = 4.623561956057013 Fits in! Difference between the unsuccessful and successful = 0.7905138339920947 *** 23-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(23) = 89 >>> Theoretic accumulative number of comps in successful searches in an 23-element array = 89 Match! Avg = 3.869565217391304 Approximate low value of avg = 3.584962500721157 Approximate high value of avg = 3.684962500721157 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(23) = 112 >>> Theoretic accumulative number of comps in unsuccessful searches in an 23-element array = 112 Match! Avg = 4.666666666666667 Approximate low value of avg = 4.584962500721157 Approximate high value of avg = 4.684962500721157 Fits in! Difference between the unsuccessful and successful = 0.7971014492753628 *** 24-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(24) = 94 >>> Theoretic accumulative number of comps in successful searches in an 24-element array = 94 Match! Avg = 3.9166666666666665 Approximate low value of avg = 3.6438561897747244 Approximate high value of avg = 3.7438561897747245 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(24) = 118 >>> Theoretic accumulative number of comps in unsuccessful searches in an 24-element array = 118 Match! Avg = 4.72 Approximate low value of avg = 4.643856189774724 Approximate high value of avg = 4.743856189774724 Fits in! Difference between the unsuccessful and successful = 0.8033333333333332 *** 25-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(25) = 99 >>> Theoretic accumulative number of comps in successful searches in an 25-element array = 99 Match! Avg = 3.96 Approximate low value of avg = 3.7004397181410926 Approximate high value of avg = 3.8004397181410927 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(25) = 124 >>> Theoretic accumulative number of comps in unsuccessful searches in an 25-element array = 124 Match! Avg = 4.769230769230769 Approximate low value of avg = 4.700439718141093 Approximate high value of avg = 4.800439718141092 Fits in! Difference between the unsuccessful and successful = 0.8092307692307692 *** 26-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(26) = 104 >>> Theoretic accumulative number of comps in successful searches in an 26-element array = 104 Match! Avg = 4.0 Approximate low value of avg = 3.754887502163469 Approximate high value of avg = 3.854887502163469 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(26) = 130 >>> Theoretic accumulative number of comps in unsuccessful searches in an 26-element array = 130 Match! Avg = 4.814814814814815 Approximate low value of avg = 4.754887502163469 Approximate high value of avg = 4.854887502163469 Fits in! Difference between the unsuccessful and successful = 0.8148148148148149 *** 27-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(27) = 109 >>> Theoretic accumulative number of comps in successful searches in an 27-element array = 109 Match! Avg = 4.037037037037037 Approximate low value of avg = 3.8073549220576037 Approximate high value of avg = 3.907354922057604 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(27) = 136 >>> Theoretic accumulative number of comps in unsuccessful searches in an 27-element array = 136 Match! Avg = 4.857142857142857 Approximate low value of avg = 4.807354922057604 Approximate high value of avg = 4.907354922057603 Fits in! Difference between the unsuccessful and successful = 0.8201058201058196 *** 28-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(28) = 114 >>> Theoretic accumulative number of comps in successful searches in an 28-element array = 114 Match! Avg = 4.071428571428571 Approximate low value of avg = 3.8579809951275728 Approximate high value of avg = 3.957980995127573 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(28) = 142 >>> Theoretic accumulative number of comps in unsuccessful searches in an 28-element array = 142 Match! Avg = 4.896551724137931 Approximate low value of avg = 4.857980995127573 Approximate high value of avg = 4.957980995127572 Fits in! Difference between the unsuccessful and successful = 0.8251231527093594 *** 29-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(29) = 119 >>> Theoretic accumulative number of comps in successful searches in an 29-element array = 119 Match! Avg = 4.103448275862069 Approximate low value of avg = 3.9068905956085187 Approximate high value of avg = 4.006890595608518 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(29) = 148 >>> Theoretic accumulative number of comps in unsuccessful searches in an 29-element array = 148 Match! Avg = 4.933333333333334 Approximate low value of avg = 4.906890595608519 Approximate high value of avg = 5.006890595608518 Fits in! Difference between the unsuccessful and successful = 0.8298850574712642 *** 30-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(30) = 124 >>> Theoretic accumulative number of comps in successful searches in an 30-element array = 124 Match! Avg = 4.133333333333334 Approximate low value of avg = 3.954196310386876 Approximate high value of avg = 4.0541963103868754 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(30) = 154 >>> Theoretic accumulative number of comps in unsuccessful searches in an 30-element array = 154 Match! Avg = 4.967741935483871 Approximate low value of avg = 4.954196310386876 Approximate high value of avg = 5.0541963103868754 Fits in! Difference between the unsuccessful and successful = 0.8344086021505372 *** 31-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(31) = 129 >>> Theoretic accumulative number of comps in successful searches in an 31-element array = 129 Match! Avg = 4.161290322580645 Approximate low value of avg = 4.0 Approximate high value of avg = 4.1 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(31) = 160 >>> Theoretic accumulative number of comps in unsuccessful searches in an 31-element array = 160 Match! Avg = 5.0 Approximate low value of avg = 5.0 Approximate high value of avg = 5.1 Fits in! Difference between the unsuccessful and successful = 0.838709677419355 *** 32-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(32) = 135 >>> Theoretic accumulative number of comps in successful searches in an 32-element array = 135 Match! Avg = 4.21875 Approximate low value of avg = 4.044394119358453 Approximate high value of avg = 4.144394119358453 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(32) = 167 >>> Theoretic accumulative number of comps in unsuccessful searches in an 32-element array = 167 Match! Avg = 5.0606060606060606 Approximate low value of avg = 5.044394119358453 Approximate high value of avg = 5.144394119358453 Fits in! Difference between the unsuccessful and successful = 0.8418560606060606 *** 33-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(33) = 141 >>> Theoretic accumulative number of comps in successful searches in an 33-element array = 141 Match! Avg = 4.2727272727272725 Approximate low value of avg = 4.08746284125034 Approximate high value of avg = 4.18746284125034 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(33) = 174 >>> Theoretic accumulative number of comps in unsuccessful searches in an 33-element array = 174 Match! Avg = 5.117647058823529 Approximate low value of avg = 5.08746284125034 Approximate high value of avg = 5.18746284125034 Fits in! Difference between the unsuccessful and successful = 0.8449197860962565 *** 34-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(34) = 147 >>> Theoretic accumulative number of comps in successful searches in an 34-element array = 147 Match! Avg = 4.323529411764706 Approximate low value of avg = 4.129283016944966 Approximate high value of avg = 4.229283016944966 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(34) = 181 >>> Theoretic accumulative number of comps in unsuccessful searches in an 34-element array = 181 Match! Avg = 5.171428571428572 Approximate low value of avg = 5.129283016944966 Approximate high value of avg = 5.229283016944966 Fits in! Difference between the unsuccessful and successful = 0.8478991596638661 *** 35-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(35) = 153 >>> Theoretic accumulative number of comps in successful searches in an 35-element array = 153 Match! Avg = 4.371428571428571 Approximate low value of avg = 4.169925001442312 Approximate high value of avg = 4.269925001442312 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(35) = 188 >>> Theoretic accumulative number of comps in unsuccessful searches in an 35-element array = 188 Match! Avg = 5.222222222222222 Approximate low value of avg = 5.169925001442312 Approximate high value of avg = 5.269925001442312 Fits in! Difference between the unsuccessful and successful = 0.8507936507936513 *** 36-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(36) = 159 >>> Theoretic accumulative number of comps in successful searches in an 36-element array = 159 Match! Avg = 4.416666666666667 Approximate low value of avg = 4.20945336562895 Approximate high value of avg = 4.30945336562895 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(36) = 195 >>> Theoretic accumulative number of comps in unsuccessful searches in an 36-element array = 195 Match! Avg = 5.27027027027027 Approximate low value of avg = 5.20945336562895 Approximate high value of avg = 5.30945336562895 Fits in! Difference between the unsuccessful and successful = 0.8536036036036032 *** 37-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(37) = 165 >>> Theoretic accumulative number of comps in successful searches in an 37-element array = 165 Match! Avg = 4.45945945945946 Approximate low value of avg = 4.247927513443585 Approximate high value of avg = 4.347927513443585 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(37) = 202 >>> Theoretic accumulative number of comps in unsuccessful searches in an 37-element array = 202 Match! Avg = 5.315789473684211 Approximate low value of avg = 5.247927513443585 Approximate high value of avg = 5.347927513443585 Fits in! Difference between the unsuccessful and successful = 0.856330014224751 *** 38-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(38) = 171 >>> Theoretic accumulative number of comps in successful searches in an 38-element array = 171 Match! Avg = 4.5 Approximate low value of avg = 4.285402218862249 Approximate high value of avg = 4.385402218862248 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(38) = 209 >>> Theoretic accumulative number of comps in unsuccessful searches in an 38-element array = 209 Match! Avg = 5.358974358974359 Approximate low value of avg = 5.285402218862249 Approximate high value of avg = 5.385402218862248 Fits in! Difference between the unsuccessful and successful = 0.8589743589743586 *** 39-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(39) = 177 >>> Theoretic accumulative number of comps in successful searches in an 39-element array = 177 Match! Avg = 4.538461538461538 Approximate low value of avg = 4.321928094887363 Approximate high value of avg = 4.421928094887362 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(39) = 216 >>> Theoretic accumulative number of comps in unsuccessful searches in an 39-element array = 216 Match! Avg = 5.4 Approximate low value of avg = 5.321928094887363 Approximate high value of avg = 5.421928094887362 Fits in! Difference between the unsuccessful and successful = 0.861538461538462 *** 40-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(40) = 183 >>> Theoretic accumulative number of comps in successful searches in an 40-element array = 183 Match! Avg = 4.575 Approximate low value of avg = 4.357552004618084 Approximate high value of avg = 4.457552004618083 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(40) = 223 >>> Theoretic accumulative number of comps in unsuccessful searches in an 40-element array = 223 Match! Avg = 5.439024390243903 Approximate low value of avg = 5.357552004618084 Approximate high value of avg = 5.457552004618083 Fits in! Difference between the unsuccessful and successful = 0.8640243902439027 *** 41-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(41) = 189 >>> Theoretic accumulative number of comps in successful searches in an 41-element array = 189 Match! Avg = 4.609756097560975 Approximate low value of avg = 4.392317422778761 Approximate high value of avg = 4.49231742277876 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(41) = 230 >>> Theoretic accumulative number of comps in unsuccessful searches in an 41-element array = 230 Match! Avg = 5.476190476190476 Approximate low value of avg = 5.392317422778761 Approximate high value of avg = 5.49231742277876 Fits in! Difference between the unsuccessful and successful = 0.866434378629501 *** 42-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(42) = 195 >>> Theoretic accumulative number of comps in successful searches in an 42-element array = 195 Match! Avg = 4.642857142857143 Approximate low value of avg = 4.426264754702098 Approximate high value of avg = 4.5262647547020975 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(42) = 237 >>> Theoretic accumulative number of comps in unsuccessful searches in an 42-element array = 237 Match! Avg = 5.511627906976744 Approximate low value of avg = 5.426264754702098 Approximate high value of avg = 5.5262647547020975 Fits in! Difference between the unsuccessful and successful = 0.868770764119601 *** 43-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(43) = 201 >>> Theoretic accumulative number of comps in successful searches in an 43-element array = 201 Match! Avg = 4.674418604651163 Approximate low value of avg = 4.459431618637297 Approximate high value of avg = 4.559431618637297 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(43) = 244 >>> Theoretic accumulative number of comps in unsuccessful searches in an 43-element array = 244 Match! Avg = 5.545454545454546 Approximate low value of avg = 5.459431618637297 Approximate high value of avg = 5.559431618637297 Fits in! Difference between the unsuccessful and successful = 0.8710359408033828 *** 44-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(44) = 207 >>> Theoretic accumulative number of comps in successful searches in an 44-element array = 207 Match! Avg = 4.704545454545454 Approximate low value of avg = 4.491853096329675 Approximate high value of avg = 4.591853096329674 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(44) = 251 >>> Theoretic accumulative number of comps in unsuccessful searches in an 44-element array = 251 Match! Avg = 5.5777777777777775 Approximate low value of avg = 5.491853096329675 Approximate high value of avg = 5.591853096329674 Fits in! Difference between the unsuccessful and successful = 0.8732323232323234 *** 45-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(45) = 213 >>> Theoretic accumulative number of comps in successful searches in an 45-element array = 213 Match! Avg = 4.733333333333333 Approximate low value of avg = 4.523561956057013 Approximate high value of avg = 4.623561956057013 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(45) = 258 >>> Theoretic accumulative number of comps in unsuccessful searches in an 45-element array = 258 Match! Avg = 5.608695652173913 Approximate low value of avg = 5.523561956057013 Approximate high value of avg = 5.623561956057013 Fits in! Difference between the unsuccessful and successful = 0.8753623188405797 *** 46-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(46) = 219 >>> Theoretic accumulative number of comps in successful searches in an 46-element array = 219 Match! Avg = 4.760869565217392 Approximate low value of avg = 4.554588851677638 Approximate high value of avg = 4.654588851677637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(46) = 265 >>> Theoretic accumulative number of comps in unsuccessful searches in an 46-element array = 265 Match! Avg = 5.638297872340425 Approximate low value of avg = 5.554588851677638 Approximate high value of avg = 5.654588851677637 Fits in! Difference between the unsuccessful and successful = 0.8774283071230338 *** 47-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(47) = 225 >>> Theoretic accumulative number of comps in successful searches in an 47-element array = 225 Match! Avg = 4.787234042553192 Approximate low value of avg = 4.584962500721157 Approximate high value of avg = 4.684962500721157 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(47) = 272 >>> Theoretic accumulative number of comps in unsuccessful searches in an 47-element array = 272 Match! Avg = 5.666666666666667 Approximate low value of avg = 5.584962500721157 Approximate high value of avg = 5.684962500721157 Fits in! Difference between the unsuccessful and successful = 0.8794326241134751 *** 48-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(48) = 231 >>> Theoretic accumulative number of comps in successful searches in an 48-element array = 231 Match! Avg = 4.8125 Approximate low value of avg = 4.614709844115208 Approximate high value of avg = 4.714709844115208 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(48) = 279 >>> Theoretic accumulative number of comps in unsuccessful searches in an 48-element array = 279 Match! Avg = 5.6938775510204085 Approximate low value of avg = 5.614709844115208 Approximate high value of avg = 5.714709844115208 Fits in! Difference between the unsuccessful and successful = 0.8813775510204085 *** 49-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(49) = 237 >>> Theoretic accumulative number of comps in successful searches in an 49-element array = 237 Match! Avg = 4.836734693877551 Approximate low value of avg = 4.643856189774724 Approximate high value of avg = 4.743856189774724 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(49) = 286 >>> Theoretic accumulative number of comps in unsuccessful searches in an 49-element array = 286 Match! Avg = 5.72 Approximate low value of avg = 5.643856189774724 Approximate high value of avg = 5.743856189774724 Fits in! Difference between the unsuccessful and successful = 0.8832653061224489 *** 50-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(50) = 243 >>> Theoretic accumulative number of comps in successful searches in an 50-element array = 243 Match! Avg = 4.86 Approximate low value of avg = 4.672425341971496 Approximate high value of avg = 4.772425341971496 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(50) = 293 >>> Theoretic accumulative number of comps in unsuccessful searches in an 50-element array = 293 Match! Avg = 5.745098039215686 Approximate low value of avg = 5.672425341971496 Approximate high value of avg = 5.772425341971496 Fits in! Difference between the unsuccessful and successful = 0.885098039215686 *** 51-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(51) = 249 >>> Theoretic accumulative number of comps in successful searches in an 51-element array = 249 Match! Avg = 4.882352941176471 Approximate low value of avg = 4.700439718141093 Approximate high value of avg = 4.800439718141092 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(51) = 300 >>> Theoretic accumulative number of comps in unsuccessful searches in an 51-element array = 300 Match! Avg = 5.769230769230769 Approximate low value of avg = 5.700439718141093 Approximate high value of avg = 5.800439718141092 Fits in! Difference between the unsuccessful and successful = 0.8868778280542982 *** 52-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(52) = 255 >>> Theoretic accumulative number of comps in successful searches in an 52-element array = 255 Match! Avg = 4.903846153846154 Approximate low value of avg = 4.7279204545632 Approximate high value of avg = 4.827920454563199 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(52) = 307 >>> Theoretic accumulative number of comps in unsuccessful searches in an 52-element array = 307 Match! Avg = 5.7924528301886795 Approximate low value of avg = 5.7279204545632 Approximate high value of avg = 5.827920454563199 Fits in! Difference between the unsuccessful and successful = 0.8886066763425253 *** 53-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(53) = 261 >>> Theoretic accumulative number of comps in successful searches in an 53-element array = 261 Match! Avg = 4.9245283018867925 Approximate low value of avg = 4.754887502163469 Approximate high value of avg = 4.854887502163469 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(53) = 314 >>> Theoretic accumulative number of comps in unsuccessful searches in an 53-element array = 314 Match! Avg = 5.814814814814815 Approximate low value of avg = 5.754887502163469 Approximate high value of avg = 5.854887502163469 Fits in! Difference between the unsuccessful and successful = 0.8902865129280224 *** 54-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(54) = 267 >>> Theoretic accumulative number of comps in successful searches in an 54-element array = 267 Match! Avg = 4.944444444444445 Approximate low value of avg = 4.78135971352466 Approximate high value of avg = 4.88135971352466 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(54) = 321 >>> Theoretic accumulative number of comps in unsuccessful searches in an 54-element array = 321 Match! Avg = 5.836363636363636 Approximate low value of avg = 5.78135971352466 Approximate high value of avg = 5.88135971352466 Fits in! Difference between the unsuccessful and successful = 0.8919191919191913 *** 55-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(55) = 273 >>> Theoretic accumulative number of comps in successful searches in an 55-element array = 273 Match! Avg = 4.963636363636364 Approximate low value of avg = 4.807354922057605 Approximate high value of avg = 4.907354922057604 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(55) = 328 >>> Theoretic accumulative number of comps in unsuccessful searches in an 55-element array = 328 Match! Avg = 5.857142857142857 Approximate low value of avg = 5.807354922057605 Approximate high value of avg = 5.907354922057604 Fits in! Difference between the unsuccessful and successful = 0.8935064935064929 *** 56-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(56) = 279 >>> Theoretic accumulative number of comps in successful searches in an 56-element array = 279 Match! Avg = 4.982142857142857 Approximate low value of avg = 4.832890014164742 Approximate high value of avg = 4.932890014164742 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(56) = 335 >>> Theoretic accumulative number of comps in unsuccessful searches in an 56-element array = 335 Match! Avg = 5.87719298245614 Approximate low value of avg = 5.832890014164742 Approximate high value of avg = 5.932890014164742 Fits in! Difference between the unsuccessful and successful = 0.8950501253132837 *** 57-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(57) = 285 >>> Theoretic accumulative number of comps in successful searches in an 57-element array = 285 Match! Avg = 5.0 Approximate low value of avg = 4.857980995127572 Approximate high value of avg = 4.9579809951275715 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(57) = 342 >>> Theoretic accumulative number of comps in unsuccessful searches in an 57-element array = 342 Match! Avg = 5.896551724137931 Approximate low value of avg = 5.857980995127572 Approximate high value of avg = 5.9579809951275715 Fits in! Difference between the unsuccessful and successful = 0.8965517241379306 *** 58-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(58) = 291 >>> Theoretic accumulative number of comps in successful searches in an 58-element array = 291 Match! Avg = 5.017241379310345 Approximate low value of avg = 4.882643049361842 Approximate high value of avg = 4.982643049361841 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(58) = 349 >>> Theoretic accumulative number of comps in unsuccessful searches in an 58-element array = 349 Match! Avg = 5.915254237288136 Approximate low value of avg = 5.882643049361842 Approximate high value of avg = 5.982643049361841 Fits in! Difference between the unsuccessful and successful = 0.8980128579777906 *** 59-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(59) = 297 >>> Theoretic accumulative number of comps in successful searches in an 59-element array = 297 Match! Avg = 5.033898305084746 Approximate low value of avg = 4.906890595608519 Approximate high value of avg = 5.006890595608518 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(59) = 356 >>> Theoretic accumulative number of comps in unsuccessful searches in an 59-element array = 356 Match! Avg = 5.933333333333334 Approximate low value of avg = 5.906890595608519 Approximate high value of avg = 6.006890595608518 Fits in! Difference between the unsuccessful and successful = 0.8994350282485879 *** 60-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(60) = 303 >>> Theoretic accumulative number of comps in successful searches in an 60-element array = 303 Match! Avg = 5.05 Approximate low value of avg = 4.930737337562887 Approximate high value of avg = 5.030737337562886 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(60) = 363 >>> Theoretic accumulative number of comps in unsuccessful searches in an 60-element array = 363 Match! Avg = 5.950819672131147 Approximate low value of avg = 5.930737337562887 Approximate high value of avg = 6.030737337562886 Fits in! Difference between the unsuccessful and successful = 0.9008196721311474 *** 61-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(61) = 309 >>> Theoretic accumulative number of comps in successful searches in an 61-element array = 309 Match! Avg = 5.065573770491803 Approximate low value of avg = 4.954196310386876 Approximate high value of avg = 5.0541963103868754 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(61) = 370 >>> Theoretic accumulative number of comps in unsuccessful searches in an 61-element array = 370 Match! Avg = 5.967741935483871 Approximate low value of avg = 5.954196310386876 Approximate high value of avg = 6.0541963103868754 Fits in! Difference between the unsuccessful and successful = 0.9021681649920676 *** 62-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(62) = 315 >>> Theoretic accumulative number of comps in successful searches in an 62-element array = 315 Match! Avg = 5.080645161290323 Approximate low value of avg = 4.977279923499917 Approximate high value of avg = 5.077279923499916 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(62) = 377 >>> Theoretic accumulative number of comps in unsuccessful searches in an 62-element array = 377 Match! Avg = 5.984126984126984 Approximate low value of avg = 5.977279923499917 Approximate high value of avg = 6.077279923499916 Fits in! Difference between the unsuccessful and successful = 0.9034818228366612 *** 63-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(63) = 321 >>> Theoretic accumulative number of comps in successful searches in an 63-element array = 321 Match! Avg = 5.095238095238095 Approximate low value of avg = 5.0 Approximate high value of avg = 5.1 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(63) = 384 >>> Theoretic accumulative number of comps in unsuccessful searches in an 63-element array = 384 Match! Avg = 6.0 Approximate low value of avg = 6.0 Approximate high value of avg = 6.1 Fits in! Difference between the unsuccessful and successful = 0.9047619047619051 *** 64-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(64) = 328 >>> Theoretic accumulative number of comps in successful searches in an 64-element array = 328 Match! Avg = 5.125 Approximate low value of avg = 5.022367813028454 Approximate high value of avg = 5.122367813028454 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(64) = 392 >>> Theoretic accumulative number of comps in unsuccessful searches in an 64-element array = 392 Match! Avg = 6.030769230769231 Approximate low value of avg = 6.022367813028454 Approximate high value of avg = 6.122367813028454 Fits in! Difference between the unsuccessful and successful = 0.9057692307692307 *** 65-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(65) = 335 >>> Theoretic accumulative number of comps in successful searches in an 65-element array = 335 Match! Avg = 5.153846153846154 Approximate low value of avg = 5.044394119358453 Approximate high value of avg = 5.144394119358453 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(65) = 400 >>> Theoretic accumulative number of comps in unsuccessful searches in an 65-element array = 400 Match! Avg = 6.0606060606060606 Approximate low value of avg = 6.044394119358453 Approximate high value of avg = 6.144394119358453 Fits in! Difference between the unsuccessful and successful = 0.9067599067599064 *** 66-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(66) = 342 >>> Theoretic accumulative number of comps in successful searches in an 66-element array = 342 Match! Avg = 5.181818181818182 Approximate low value of avg = 5.066089190457772 Approximate high value of avg = 5.166089190457772 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(66) = 408 >>> Theoretic accumulative number of comps in unsuccessful searches in an 66-element array = 408 Match! Avg = 6.08955223880597 Approximate low value of avg = 6.066089190457772 Approximate high value of avg = 6.166089190457772 Fits in! Difference between the unsuccessful and successful = 0.9077340569877883 *** 67-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(67) = 349 >>> Theoretic accumulative number of comps in successful searches in an 67-element array = 349 Match! Avg = 5.208955223880597 Approximate low value of avg = 5.08746284125034 Approximate high value of avg = 5.18746284125034 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(67) = 416 >>> Theoretic accumulative number of comps in unsuccessful searches in an 67-element array = 416 Match! Avg = 6.117647058823529 Approximate low value of avg = 6.08746284125034 Approximate high value of avg = 6.18746284125034 Fits in! Difference between the unsuccessful and successful = 0.9086918349429318 *** 68-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(68) = 356 >>> Theoretic accumulative number of comps in successful searches in an 68-element array = 356 Match! Avg = 5.235294117647059 Approximate low value of avg = 5.10852445677817 Approximate high value of avg = 5.20852445677817 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(68) = 424 >>> Theoretic accumulative number of comps in unsuccessful searches in an 68-element array = 424 Match! Avg = 6.144927536231884 Approximate low value of avg = 6.10852445677817 Approximate high value of avg = 6.20852445677817 Fits in! Difference between the unsuccessful and successful = 0.9096334185848249 *** 69-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(69) = 363 >>> Theoretic accumulative number of comps in successful searches in an 69-element array = 363 Match! Avg = 5.260869565217392 Approximate low value of avg = 5.129283016944967 Approximate high value of avg = 5.229283016944967 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(69) = 432 >>> Theoretic accumulative number of comps in unsuccessful searches in an 69-element array = 432 Match! Avg = 6.171428571428572 Approximate low value of avg = 6.129283016944967 Approximate high value of avg = 6.229283016944967 Fits in! Difference between the unsuccessful and successful = 0.9105590062111801 *** 70-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(70) = 370 >>> Theoretic accumulative number of comps in successful searches in an 70-element array = 370 Match! Avg = 5.285714285714286 Approximate low value of avg = 5.149747119504682 Approximate high value of avg = 5.249747119504682 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(70) = 440 >>> Theoretic accumulative number of comps in unsuccessful searches in an 70-element array = 440 Match! Avg = 6.197183098591549 Approximate low value of avg = 6.149747119504682 Approximate high value of avg = 6.249747119504682 Fits in! Difference between the unsuccessful and successful = 0.9114688128772634 *** 71-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(71) = 377 >>> Theoretic accumulative number of comps in successful searches in an 71-element array = 377 Match! Avg = 5.309859154929577 Approximate low value of avg = 5.169925001442312 Approximate high value of avg = 5.269925001442312 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(71) = 448 >>> Theoretic accumulative number of comps in unsuccessful searches in an 71-element array = 448 Match! Avg = 6.222222222222222 Approximate low value of avg = 6.169925001442312 Approximate high value of avg = 6.269925001442312 Fits in! Difference between the unsuccessful and successful = 0.9123630672926453 *** 72-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(72) = 384 >>> Theoretic accumulative number of comps in successful searches in an 72-element array = 384 Match! Avg = 5.333333333333333 Approximate low value of avg = 5.189824558880018 Approximate high value of avg = 5.289824558880017 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(72) = 456 >>> Theoretic accumulative number of comps in unsuccessful searches in an 72-element array = 456 Match! Avg = 6.2465753424657535 Approximate low value of avg = 6.189824558880018 Approximate high value of avg = 6.289824558880017 Fits in! Difference between the unsuccessful and successful = 0.9132420091324205 *** 73-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(73) = 391 >>> Theoretic accumulative number of comps in successful searches in an 73-element array = 391 Match! Avg = 5.3561643835616435 Approximate low value of avg = 5.209453365628951 Approximate high value of avg = 5.309453365628951 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(73) = 464 >>> Theoretic accumulative number of comps in unsuccessful searches in an 73-element array = 464 Match! Avg = 6.27027027027027 Approximate low value of avg = 6.209453365628951 Approximate high value of avg = 6.309453365628951 Fits in! Difference between the unsuccessful and successful = 0.9141058867086267 *** 74-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(74) = 398 >>> Theoretic accumulative number of comps in successful searches in an 74-element array = 398 Match! Avg = 5.378378378378378 Approximate low value of avg = 5.22881869049588 Approximate high value of avg = 5.32881869049588 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(74) = 472 >>> Theoretic accumulative number of comps in unsuccessful searches in an 74-element array = 472 Match! Avg = 6.293333333333333 Approximate low value of avg = 6.22881869049588 Approximate high value of avg = 6.32881869049588 Fits in! Difference between the unsuccessful and successful = 0.9149549549549549 *** 75-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(75) = 405 >>> Theoretic accumulative number of comps in successful searches in an 75-element array = 405 Match! Avg = 5.4 Approximate low value of avg = 5.247927513443586 Approximate high value of avg = 5.347927513443586 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(75) = 480 >>> Theoretic accumulative number of comps in unsuccessful searches in an 75-element array = 480 Match! Avg = 6.315789473684211 Approximate low value of avg = 6.247927513443586 Approximate high value of avg = 6.347927513443586 Fits in! Difference between the unsuccessful and successful = 0.9157894736842103 *** 76-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(76) = 412 >>> Theoretic accumulative number of comps in successful searches in an 76-element array = 412 Match! Avg = 5.421052631578948 Approximate low value of avg = 5.266786540694902 Approximate high value of avg = 5.366786540694902 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(76) = 488 >>> Theoretic accumulative number of comps in unsuccessful searches in an 76-element array = 488 Match! Avg = 6.337662337662338 Approximate low value of avg = 6.266786540694902 Approximate high value of avg = 6.366786540694902 Fits in! Difference between the unsuccessful and successful = 0.9166097060833902 *** 77-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(77) = 419 >>> Theoretic accumulative number of comps in successful searches in an 77-element array = 419 Match! Avg = 5.441558441558442 Approximate low value of avg = 5.285402218862249 Approximate high value of avg = 5.385402218862248 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(77) = 496 >>> Theoretic accumulative number of comps in unsuccessful searches in an 77-element array = 496 Match! Avg = 6.358974358974359 Approximate low value of avg = 6.285402218862249 Approximate high value of avg = 6.385402218862248 Fits in! Difference between the unsuccessful and successful = 0.9174159174159167 *** 78-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(78) = 426 >>> Theoretic accumulative number of comps in successful searches in an 78-element array = 426 Match! Avg = 5.461538461538462 Approximate low value of avg = 5.303780748177103 Approximate high value of avg = 5.403780748177103 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(78) = 504 >>> Theoretic accumulative number of comps in unsuccessful searches in an 78-element array = 504 Match! Avg = 6.379746835443038 Approximate low value of avg = 6.303780748177103 Approximate high value of avg = 6.403780748177103 Fits in! Difference between the unsuccessful and successful = 0.9182083739045765 *** 79-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(79) = 433 >>> Theoretic accumulative number of comps in successful searches in an 79-element array = 433 Match! Avg = 5.481012658227848 Approximate low value of avg = 5.321928094887362 Approximate high value of avg = 5.421928094887361 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(79) = 512 >>> Theoretic accumulative number of comps in unsuccessful searches in an 79-element array = 512 Match! Avg = 6.4 Approximate low value of avg = 6.321928094887362 Approximate high value of avg = 6.421928094887361 Fits in! Difference between the unsuccessful and successful = 0.9189873417721524 *** 80-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(80) = 440 >>> Theoretic accumulative number of comps in successful searches in an 80-element array = 440 Match! Avg = 5.5 Approximate low value of avg = 5.339850002884625 Approximate high value of avg = 5.439850002884625 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(80) = 520 >>> Theoretic accumulative number of comps in unsuccessful searches in an 80-element array = 520 Match! Avg = 6.419753086419753 Approximate low value of avg = 6.339850002884625 Approximate high value of avg = 6.439850002884625 Fits in! Difference between the unsuccessful and successful = 0.9197530864197532 *** 81-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(81) = 447 >>> Theoretic accumulative number of comps in successful searches in an 81-element array = 447 Match! Avg = 5.518518518518518 Approximate low value of avg = 5.357552004618085 Approximate high value of avg = 5.457552004618084 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(81) = 528 >>> Theoretic accumulative number of comps in unsuccessful searches in an 81-element array = 528 Match! Avg = 6.439024390243903 Approximate low value of avg = 6.357552004618085 Approximate high value of avg = 6.457552004618084 Fits in! Difference between the unsuccessful and successful = 0.9205058717253847 *** 82-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(82) = 454 >>> Theoretic accumulative number of comps in successful searches in an 82-element array = 454 Match! Avg = 5.536585365853658 Approximate low value of avg = 5.375039431346925 Approximate high value of avg = 5.475039431346925 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(82) = 536 >>> Theoretic accumulative number of comps in unsuccessful searches in an 82-element array = 536 Match! Avg = 6.457831325301205 Approximate low value of avg = 6.375039431346925 Approximate high value of avg = 6.475039431346925 Fits in! Difference between the unsuccessful and successful = 0.9212459594475471 *** 83-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(83) = 461 >>> Theoretic accumulative number of comps in successful searches in an 83-element array = 461 Match! Avg = 5.554216867469879 Approximate low value of avg = 5.39231742277876 Approximate high value of avg = 5.4923174227787595 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(83) = 544 >>> Theoretic accumulative number of comps in unsuccessful searches in an 83-element array = 544 Match! Avg = 6.476190476190476 Approximate low value of avg = 6.39231742277876 Approximate high value of avg = 6.4923174227787595 Fits in! Difference between the unsuccessful and successful = 0.921973608720597 *** 84-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(84) = 468 >>> Theoretic accumulative number of comps in successful searches in an 84-element array = 468 Match! Avg = 5.571428571428571 Approximate low value of avg = 5.409390936137703 Approximate high value of avg = 5.509390936137702 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(84) = 552 >>> Theoretic accumulative number of comps in unsuccessful searches in an 84-element array = 552 Match! Avg = 6.4941176470588236 Approximate low value of avg = 6.409390936137703 Approximate high value of avg = 6.509390936137702 Fits in! Difference between the unsuccessful and successful = 0.9226890756302524 *** 85-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(85) = 475 >>> Theoretic accumulative number of comps in successful searches in an 85-element array = 475 Match! Avg = 5.588235294117647 Approximate low value of avg = 5.426264754702098 Approximate high value of avg = 5.5262647547020975 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(85) = 560 >>> Theoretic accumulative number of comps in unsuccessful searches in an 85-element array = 560 Match! Avg = 6.511627906976744 Approximate low value of avg = 6.426264754702098 Approximate high value of avg = 6.5262647547020975 Fits in! Difference between the unsuccessful and successful = 0.9233926128590975 *** 86-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(86) = 482 >>> Theoretic accumulative number of comps in successful searches in an 86-element array = 482 Match! Avg = 5.604651162790698 Approximate low value of avg = 5.442943495848729 Approximate high value of avg = 5.5429434958487285 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(86) = 568 >>> Theoretic accumulative number of comps in unsuccessful searches in an 86-element array = 568 Match! Avg = 6.528735632183908 Approximate low value of avg = 6.442943495848729 Approximate high value of avg = 6.5429434958487285 Fits in! Difference between the unsuccessful and successful = 0.9240844693932102 *** 87-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(87) = 489 >>> Theoretic accumulative number of comps in successful searches in an 87-element array = 489 Match! Avg = 5.620689655172414 Approximate low value of avg = 5.459431618637298 Approximate high value of avg = 5.559431618637298 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(87) = 576 >>> Theoretic accumulative number of comps in unsuccessful searches in an 87-element array = 576 Match! Avg = 6.545454545454546 Approximate low value of avg = 6.459431618637298 Approximate high value of avg = 6.559431618637298 Fits in! Difference between the unsuccessful and successful = 0.9247648902821322 *** 88-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(88) = 496 >>> Theoretic accumulative number of comps in successful searches in an 88-element array = 496 Match! Avg = 5.636363636363637 Approximate low value of avg = 5.475733430966398 Approximate high value of avg = 5.575733430966397 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(88) = 584 >>> Theoretic accumulative number of comps in unsuccessful searches in an 88-element array = 584 Match! Avg = 6.561797752808989 Approximate low value of avg = 6.475733430966398 Approximate high value of avg = 6.575733430966397 Fits in! Difference between the unsuccessful and successful = 0.9254341164453521 *** 89-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(89) = 503 >>> Theoretic accumulative number of comps in successful searches in an 89-element array = 503 Match! Avg = 5.651685393258427 Approximate low value of avg = 5.491853096329675 Approximate high value of avg = 5.591853096329674 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(89) = 592 >>> Theoretic accumulative number of comps in unsuccessful searches in an 89-element array = 592 Match! Avg = 6.5777777777777775 Approximate low value of avg = 6.491853096329675 Approximate high value of avg = 6.591853096329674 Fits in! Difference between the unsuccessful and successful = 0.9260923845193503 *** 90-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(90) = 510 >>> Theoretic accumulative number of comps in successful searches in an 90-element array = 510 Match! Avg = 5.666666666666667 Approximate low value of avg = 5.507794640198696 Approximate high value of avg = 5.607794640198696 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(90) = 600 >>> Theoretic accumulative number of comps in unsuccessful searches in an 90-element array = 600 Match! Avg = 6.593406593406593 Approximate low value of avg = 6.507794640198696 Approximate high value of avg = 6.607794640198696 Fits in! Difference between the unsuccessful and successful = 0.9267399267399261 *** 91-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(91) = 517 >>> Theoretic accumulative number of comps in successful searches in an 91-element array = 517 Match! Avg = 5.681318681318682 Approximate low value of avg = 5.523561956057013 Approximate high value of avg = 5.623561956057013 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(91) = 608 >>> Theoretic accumulative number of comps in unsuccessful searches in an 91-element array = 608 Match! Avg = 6.608695652173913 Approximate low value of avg = 6.523561956057013 Approximate high value of avg = 6.623561956057013 Fits in! Difference between the unsuccessful and successful = 0.9273769708552315 *** 92-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(92) = 524 >>> Theoretic accumulative number of comps in successful searches in an 92-element array = 524 Match! Avg = 5.695652173913044 Approximate low value of avg = 5.539158811108032 Approximate high value of avg = 5.6391588111080315 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(92) = 616 >>> Theoretic accumulative number of comps in unsuccessful searches in an 92-element array = 616 Match! Avg = 6.623655913978495 Approximate low value of avg = 6.539158811108032 Approximate high value of avg = 6.6391588111080315 Fits in! Difference between the unsuccessful and successful = 0.928003740065451 *** 93-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(93) = 531 >>> Theoretic accumulative number of comps in successful searches in an 93-element array = 531 Match! Avg = 5.709677419354839 Approximate low value of avg = 5.554588851677638 Approximate high value of avg = 5.654588851677637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(93) = 624 >>> Theoretic accumulative number of comps in unsuccessful searches in an 93-element array = 624 Match! Avg = 6.638297872340425 Approximate low value of avg = 6.554588851677638 Approximate high value of avg = 6.654588851677637 Fits in! Difference between the unsuccessful and successful = 0.9286204529855864 *** 94-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(94) = 538 >>> Theoretic accumulative number of comps in successful searches in an 94-element array = 538 Match! Avg = 5.723404255319149 Approximate low value of avg = 5.569855608330948 Approximate high value of avg = 5.6698556083309475 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(94) = 632 >>> Theoretic accumulative number of comps in unsuccessful searches in an 94-element array = 632 Match! Avg = 6.652631578947369 Approximate low value of avg = 6.569855608330948 Approximate high value of avg = 6.6698556083309475 Fits in! Difference between the unsuccessful and successful = 0.9292273236282194 *** 95-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(95) = 545 >>> Theoretic accumulative number of comps in successful searches in an 95-element array = 545 Match! Avg = 5.7368421052631575 Approximate low value of avg = 5.584962500721156 Approximate high value of avg = 5.684962500721156 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(95) = 640 >>> Theoretic accumulative number of comps in unsuccessful searches in an 95-element array = 640 Match! Avg = 6.666666666666667 Approximate low value of avg = 6.584962500721156 Approximate high value of avg = 6.684962500721156 Fits in! Difference between the unsuccessful and successful = 0.9298245614035094 *** 96-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(96) = 552 >>> Theoretic accumulative number of comps in successful searches in an 96-element array = 552 Match! Avg = 5.75 Approximate low value of avg = 5.599912842187128 Approximate high value of avg = 5.6999128421871275 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(96) = 648 >>> Theoretic accumulative number of comps in unsuccessful searches in an 96-element array = 648 Match! Avg = 6.680412371134021 Approximate low value of avg = 6.599912842187128 Approximate high value of avg = 6.6999128421871275 Fits in! Difference between the unsuccessful and successful = 0.9304123711340209 *** 97-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(97) = 559 >>> Theoretic accumulative number of comps in successful searches in an 97-element array = 559 Match! Avg = 5.762886597938144 Approximate low value of avg = 5.614709844115209 Approximate high value of avg = 5.714709844115209 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(97) = 656 >>> Theoretic accumulative number of comps in unsuccessful searches in an 97-element array = 656 Match! Avg = 6.6938775510204085 Approximate low value of avg = 6.614709844115209 Approximate high value of avg = 6.714709844115209 Fits in! Difference between the unsuccessful and successful = 0.9309909530822642 *** 98-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(98) = 566 >>> Theoretic accumulative number of comps in successful searches in an 98-element array = 566 Match! Avg = 5.775510204081633 Approximate low value of avg = 5.6293566200796095 Approximate high value of avg = 5.729356620079609 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(98) = 664 >>> Theoretic accumulative number of comps in unsuccessful searches in an 98-element array = 664 Match! Avg = 6.707070707070707 Approximate low value of avg = 6.6293566200796095 Approximate high value of avg = 6.729356620079609 Fits in! Difference between the unsuccessful and successful = 0.9315605029890737 *** 99-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(99) = 573 >>> Theoretic accumulative number of comps in successful searches in an 99-element array = 573 Match! Avg = 5.787878787878788 Approximate low value of avg = 5.643856189774725 Approximate high value of avg = 5.743856189774725 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(99) = 672 >>> Theoretic accumulative number of comps in unsuccessful searches in an 99-element array = 672 Match! Avg = 6.72 Approximate low value of avg = 6.643856189774725 Approximate high value of avg = 6.743856189774725 Fits in! Difference between the unsuccessful and successful = 0.9321212121212117 *** 100-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(100) = 580 >>> Theoretic accumulative number of comps in successful searches in an 100-element array = 580 Match! Avg = 5.8 Approximate low value of avg = 5.6582114827517955 Approximate high value of avg = 5.758211482751795 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(100) = 680 >>> Theoretic accumulative number of comps in unsuccessful searches in an 100-element array = 680 Match! Avg = 6.732673267326732 Approximate low value of avg = 6.6582114827517955 Approximate high value of avg = 6.758211482751795 Fits in! Difference between the unsuccessful and successful = 0.9326732673267326 *** 101-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(101) = 587 >>> Theoretic accumulative number of comps in successful searches in an 101-element array = 587 Match! Avg = 5.811881188118812 Approximate low value of avg = 5.672425341971495 Approximate high value of avg = 5.772425341971495 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(101) = 688 >>> Theoretic accumulative number of comps in unsuccessful searches in an 101-element array = 688 Match! Avg = 6.745098039215686 Approximate low value of avg = 6.672425341971495 Approximate high value of avg = 6.772425341971495 Fits in! Difference between the unsuccessful and successful = 0.9332168510968746 *** 102-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(102) = 594 >>> Theoretic accumulative number of comps in successful searches in an 102-element array = 594 Match! Avg = 5.823529411764706 Approximate low value of avg = 5.6865005271832185 Approximate high value of avg = 5.786500527183218 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(102) = 696 >>> Theoretic accumulative number of comps in unsuccessful searches in an 102-element array = 696 Match! Avg = 6.757281553398058 Approximate low value of avg = 6.6865005271832185 Approximate high value of avg = 6.786500527183218 Fits in! Difference between the unsuccessful and successful = 0.9337521416333523 *** 103-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(103) = 601 >>> Theoretic accumulative number of comps in successful searches in an 103-element array = 601 Match! Avg = 5.834951456310679 Approximate low value of avg = 5.700439718141092 Approximate high value of avg = 5.800439718141091 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(103) = 704 >>> Theoretic accumulative number of comps in unsuccessful searches in an 103-element array = 704 Match! Avg = 6.769230769230769 Approximate low value of avg = 6.700439718141092 Approximate high value of avg = 6.800439718141091 Fits in! Difference between the unsuccessful and successful = 0.9342793129200899 *** 104-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(104) = 608 >>> Theoretic accumulative number of comps in successful searches in an 104-element array = 608 Match! Avg = 5.846153846153846 Approximate low value of avg = 5.714245517666122 Approximate high value of avg = 5.814245517666122 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(104) = 712 >>> Theoretic accumulative number of comps in unsuccessful searches in an 104-element array = 712 Match! Avg = 6.780952380952381 Approximate low value of avg = 6.714245517666122 Approximate high value of avg = 6.814245517666122 Fits in! Difference between the unsuccessful and successful = 0.934798534798535 *** 105-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(105) = 615 >>> Theoretic accumulative number of comps in successful searches in an 105-element array = 615 Match! Avg = 5.857142857142857 Approximate low value of avg = 5.727920454563199 Approximate high value of avg = 5.827920454563198 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(105) = 720 >>> Theoretic accumulative number of comps in unsuccessful searches in an 105-element array = 720 Match! Avg = 6.7924528301886795 Approximate low value of avg = 6.727920454563199 Approximate high value of avg = 6.827920454563198 Fits in! Difference between the unsuccessful and successful = 0.9353099730458228 *** 106-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(106) = 622 >>> Theoretic accumulative number of comps in successful searches in an 106-element array = 622 Match! Avg = 5.867924528301887 Approximate low value of avg = 5.7414669864011465 Approximate high value of avg = 5.841466986401146 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(106) = 728 >>> Theoretic accumulative number of comps in unsuccessful searches in an 106-element array = 728 Match! Avg = 6.803738317757009 Approximate low value of avg = 6.7414669864011465 Approximate high value of avg = 6.841466986401146 Fits in! Difference between the unsuccessful and successful = 0.9358137894551222 *** 107-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(107) = 629 >>> Theoretic accumulative number of comps in successful searches in an 107-element array = 629 Match! Avg = 5.878504672897196 Approximate low value of avg = 5.754887502163469 Approximate high value of avg = 5.854887502163469 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(107) = 736 >>> Theoretic accumulative number of comps in unsuccessful searches in an 107-element array = 736 Match! Avg = 6.814814814814815 Approximate low value of avg = 6.754887502163469 Approximate high value of avg = 6.854887502163469 Fits in! Difference between the unsuccessful and successful = 0.9363101419176187 *** 108-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(108) = 636 >>> Theoretic accumulative number of comps in successful searches in an 108-element array = 636 Match! Avg = 5.888888888888889 Approximate low value of avg = 5.768184324776926 Approximate high value of avg = 5.868184324776926 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(108) = 744 >>> Theoretic accumulative number of comps in unsuccessful searches in an 108-element array = 744 Match! Avg = 6.825688073394495 Approximate low value of avg = 6.768184324776926 Approximate high value of avg = 6.868184324776926 Fits in! Difference between the unsuccessful and successful = 0.9367991845056061 *** 109-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(109) = 643 >>> Theoretic accumulative number of comps in successful searches in an 109-element array = 643 Match! Avg = 5.89908256880734 Approximate low value of avg = 5.78135971352466 Approximate high value of avg = 5.88135971352466 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(109) = 752 >>> Theoretic accumulative number of comps in unsuccessful searches in an 109-element array = 752 Match! Avg = 6.836363636363636 Approximate low value of avg = 6.78135971352466 Approximate high value of avg = 6.88135971352466 Fits in! Difference between the unsuccessful and successful = 0.9372810675562961 *** 110-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(110) = 650 >>> Theoretic accumulative number of comps in successful searches in an 110-element array = 650 Match! Avg = 5.909090909090909 Approximate low value of avg = 5.794415866350106 Approximate high value of avg = 5.894415866350106 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(110) = 760 >>> Theoretic accumulative number of comps in unsuccessful searches in an 110-element array = 760 Match! Avg = 6.846846846846847 Approximate low value of avg = 6.794415866350106 Approximate high value of avg = 6.894415866350106 Fits in! Difference between the unsuccessful and successful = 0.9377559377559379 *** 111-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(111) = 657 >>> Theoretic accumulative number of comps in successful searches in an 111-element array = 657 Match! Avg = 5.918918918918919 Approximate low value of avg = 5.807354922057604 Approximate high value of avg = 5.907354922057603 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(111) = 768 >>> Theoretic accumulative number of comps in unsuccessful searches in an 111-element array = 768 Match! Avg = 6.857142857142857 Approximate low value of avg = 6.807354922057604 Approximate high value of avg = 6.907354922057603 Fits in! Difference between the unsuccessful and successful = 0.9382239382239375 *** 112-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(112) = 664 >>> Theoretic accumulative number of comps in successful searches in an 112-element array = 664 Match! Avg = 5.928571428571429 Approximate low value of avg = 5.820178962415189 Approximate high value of avg = 5.920178962415188 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(112) = 776 >>> Theoretic accumulative number of comps in unsuccessful searches in an 112-element array = 776 Match! Avg = 6.867256637168142 Approximate low value of avg = 6.820178962415189 Approximate high value of avg = 6.920178962415188 Fits in! Difference between the unsuccessful and successful = 0.9386852085967128 *** 113-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(113) = 671 >>> Theoretic accumulative number of comps in successful searches in an 113-element array = 671 Match! Avg = 5.938053097345133 Approximate low value of avg = 5.832890014164742 Approximate high value of avg = 5.932890014164742 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(113) = 784 >>> Theoretic accumulative number of comps in unsuccessful searches in an 113-element array = 784 Match! Avg = 6.87719298245614 Approximate low value of avg = 6.832890014164742 Approximate high value of avg = 6.932890014164742 Fits in! Difference between the unsuccessful and successful = 0.9391398851110075 *** 114-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(114) = 678 >>> Theoretic accumulative number of comps in successful searches in an 114-element array = 678 Match! Avg = 5.947368421052632 Approximate low value of avg = 5.845490050944376 Approximate high value of avg = 5.945490050944375 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(114) = 792 >>> Theoretic accumulative number of comps in unsuccessful searches in an 114-element array = 792 Match! Avg = 6.886956521739131 Approximate low value of avg = 6.845490050944376 Approximate high value of avg = 6.945490050944375 Fits in! Difference between the unsuccessful and successful = 0.9395881006864988 *** 115-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(115) = 685 >>> Theoretic accumulative number of comps in successful searches in an 115-element array = 685 Match! Avg = 5.956521739130435 Approximate low value of avg = 5.857980995127572 Approximate high value of avg = 5.9579809951275715 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(115) = 800 >>> Theoretic accumulative number of comps in unsuccessful searches in an 115-element array = 800 Match! Avg = 6.896551724137931 Approximate low value of avg = 6.857980995127572 Approximate high value of avg = 6.9579809951275715 Fits in! Difference between the unsuccessful and successful = 0.940029985007496 *** 116-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(116) = 692 >>> Theoretic accumulative number of comps in successful searches in an 116-element array = 692 Match! Avg = 5.9655172413793105 Approximate low value of avg = 5.870364719583405 Approximate high value of avg = 5.970364719583404 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(116) = 808 >>> Theoretic accumulative number of comps in unsuccessful searches in an 116-element array = 808 Match! Avg = 6.905982905982906 Approximate low value of avg = 6.870364719583405 Approximate high value of avg = 6.970364719583404 Fits in! Difference between the unsuccessful and successful = 0.9404656646035958 *** 117-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(117) = 699 >>> Theoretic accumulative number of comps in successful searches in an 117-element array = 699 Match! Avg = 5.9743589743589745 Approximate low value of avg = 5.882643049361842 Approximate high value of avg = 5.982643049361841 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(117) = 816 >>> Theoretic accumulative number of comps in unsuccessful searches in an 117-element array = 816 Match! Avg = 6.915254237288136 Approximate low value of avg = 6.882643049361842 Approximate high value of avg = 6.982643049361841 Fits in! Difference between the unsuccessful and successful = 0.9408952629291614 *** 118-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(118) = 706 >>> Theoretic accumulative number of comps in successful searches in an 118-element array = 706 Match! Avg = 5.983050847457627 Approximate low value of avg = 5.894817763307944 Approximate high value of avg = 5.994817763307943 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(118) = 824 >>> Theoretic accumulative number of comps in unsuccessful searches in an 118-element array = 824 Match! Avg = 6.92436974789916 Approximate low value of avg = 6.894817763307944 Approximate high value of avg = 6.994817763307943 Fits in! Difference between the unsuccessful and successful = 0.9413189004415328 *** 119-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(119) = 713 >>> Theoretic accumulative number of comps in successful searches in an 119-element array = 713 Match! Avg = 5.991596638655462 Approximate low value of avg = 5.906890595608519 Approximate high value of avg = 6.006890595608518 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(119) = 832 >>> Theoretic accumulative number of comps in unsuccessful searches in an 119-element array = 832 Match! Avg = 6.933333333333334 Approximate low value of avg = 6.906890595608519 Approximate high value of avg = 7.006890595608518 Fits in! Difference between the unsuccessful and successful = 0.9417366946778714 *** 120-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(120) = 720 >>> Theoretic accumulative number of comps in successful searches in an 120-element array = 720 Match! Avg = 6.0 Approximate low value of avg = 5.9188632372745955 Approximate high value of avg = 6.018863237274595 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(120) = 840 >>> Theoretic accumulative number of comps in unsuccessful searches in an 120-element array = 840 Match! Avg = 6.9421487603305785 Approximate low value of avg = 6.9188632372745955 Approximate high value of avg = 7.018863237274595 Fits in! Difference between the unsuccessful and successful = 0.9421487603305785 *** 121-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(121) = 727 >>> Theoretic accumulative number of comps in successful searches in an 121-element array = 727 Match! Avg = 6.008264462809917 Approximate low value of avg = 5.930737337562887 Approximate high value of avg = 6.030737337562886 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(121) = 848 >>> Theoretic accumulative number of comps in unsuccessful searches in an 121-element array = 848 Match! Avg = 6.950819672131147 Approximate low value of avg = 6.930737337562887 Approximate high value of avg = 7.030737337562886 Fits in! Difference between the unsuccessful and successful = 0.9425552093212302 *** 122-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(122) = 734 >>> Theoretic accumulative number of comps in successful searches in an 122-element array = 734 Match! Avg = 6.016393442622951 Approximate low value of avg = 5.94251450533924 Approximate high value of avg = 6.0425145053392395 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(122) = 856 >>> Theoretic accumulative number of comps in unsuccessful searches in an 122-element array = 856 Match! Avg = 6.959349593495935 Approximate low value of avg = 6.94251450533924 Approximate high value of avg = 7.0425145053392395 Fits in! Difference between the unsuccessful and successful = 0.942956150872984 *** 123-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(123) = 741 >>> Theoretic accumulative number of comps in successful searches in an 123-element array = 741 Match! Avg = 6.024390243902439 Approximate low value of avg = 5.954196310386876 Approximate high value of avg = 6.0541963103868754 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(123) = 864 >>> Theoretic accumulative number of comps in unsuccessful searches in an 123-element array = 864 Match! Avg = 6.967741935483871 Approximate low value of avg = 6.954196310386876 Approximate high value of avg = 7.0541963103868754 Fits in! Difference between the unsuccessful and successful = 0.943351691581432 *** 124-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(124) = 748 >>> Theoretic accumulative number of comps in successful searches in an 124-element array = 748 Match! Avg = 6.032258064516129 Approximate low value of avg = 5.965784284662088 Approximate high value of avg = 6.0657842846620875 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(124) = 872 >>> Theoretic accumulative number of comps in unsuccessful searches in an 124-element array = 872 Match! Avg = 6.976 Approximate low value of avg = 6.965784284662088 Approximate high value of avg = 7.0657842846620875 Fits in! Difference between the unsuccessful and successful = 0.943741935483871 *** 125-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(125) = 755 >>> Theoretic accumulative number of comps in successful searches in an 125-element array = 755 Match! Avg = 6.04 Approximate low value of avg = 5.977279923499917 Approximate high value of avg = 6.077279923499916 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(125) = 880 >>> Theoretic accumulative number of comps in unsuccessful searches in an 125-element array = 880 Match! Avg = 6.984126984126984 Approximate low value of avg = 6.977279923499917 Approximate high value of avg = 7.077279923499916 Fits in! Difference between the unsuccessful and successful = 0.9441269841269841 *** 126-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(126) = 762 >>> Theoretic accumulative number of comps in successful searches in an 126-element array = 762 Match! Avg = 6.0476190476190474 Approximate low value of avg = 5.988684686772166 Approximate high value of avg = 6.088684686772166 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(126) = 888 >>> Theoretic accumulative number of comps in unsuccessful searches in an 126-element array = 888 Match! Avg = 6.9921259842519685 Approximate low value of avg = 6.988684686772166 Approximate high value of avg = 7.088684686772166 Fits in! Difference between the unsuccessful and successful = 0.9445069366329211 *** 127-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(127) = 769 >>> Theoretic accumulative number of comps in successful searches in an 127-element array = 769 Match! Avg = 6.05511811023622 Approximate low value of avg = 6.0 Approximate high value of avg = 6.1 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(127) = 896 >>> Theoretic accumulative number of comps in unsuccessful searches in an 127-element array = 896 Match! Avg = 7.0 Approximate low value of avg = 7.0 Approximate high value of avg = 7.1 Fits in! Difference between the unsuccessful and successful = 0.9448818897637796 *** 128-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(128) = 777 >>> Theoretic accumulative number of comps in successful searches in an 128-element array = 777 Match! Avg = 6.0703125 Approximate low value of avg = 6.011227255423254 Approximate high value of avg = 6.111227255423254 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(128) = 905 >>> Theoretic accumulative number of comps in unsuccessful searches in an 128-element array = 905 Match! Avg = 7.015503875968992 Approximate low value of avg = 7.011227255423254 Approximate high value of avg = 7.111227255423254 Fits in! Difference between the unsuccessful and successful = 0.9451913759689923 *** 129-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(129) = 785 >>> Theoretic accumulative number of comps in successful searches in an 129-element array = 785 Match! Avg = 6.0852713178294575 Approximate low value of avg = 6.022367813028454 Approximate high value of avg = 6.122367813028454 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(129) = 914 >>> Theoretic accumulative number of comps in unsuccessful searches in an 129-element array = 914 Match! Avg = 7.030769230769231 Approximate low value of avg = 7.022367813028454 Approximate high value of avg = 7.122367813028454 Fits in! Difference between the unsuccessful and successful = 0.9454979129397731 *** 130-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(130) = 793 >>> Theoretic accumulative number of comps in successful searches in an 130-element array = 793 Match! Avg = 6.1 Approximate low value of avg = 6.03342300153745 Approximate high value of avg = 6.13342300153745 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(130) = 923 >>> Theoretic accumulative number of comps in unsuccessful searches in an 130-element array = 923 Match! Avg = 7.0458015267175576 Approximate low value of avg = 7.03342300153745 Approximate high value of avg = 7.13342300153745 Fits in! Difference between the unsuccessful and successful = 0.9458015267175579 *** 131-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(131) = 801 >>> Theoretic accumulative number of comps in successful searches in an 131-element array = 801 Match! Avg = 6.114503816793893 Approximate low value of avg = 6.044394119358453 Approximate high value of avg = 6.144394119358453 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(131) = 932 >>> Theoretic accumulative number of comps in unsuccessful searches in an 131-element array = 932 Match! Avg = 7.0606060606060606 Approximate low value of avg = 7.044394119358453 Approximate high value of avg = 7.144394119358453 Fits in! Difference between the unsuccessful and successful = 0.9461022438121676 *** 132-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(132) = 809 >>> Theoretic accumulative number of comps in successful searches in an 132-element array = 809 Match! Avg = 6.128787878787879 Approximate low value of avg = 6.05528243550119 Approximate high value of avg = 6.1552824355011895 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(132) = 941 >>> Theoretic accumulative number of comps in unsuccessful searches in an 132-element array = 941 Match! Avg = 7.075187969924812 Approximate low value of avg = 7.05528243550119 Approximate high value of avg = 7.1552824355011895 Fits in! Difference between the unsuccessful and successful = 0.9464000911369332 *** 133-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(133) = 817 >>> Theoretic accumulative number of comps in successful searches in an 133-element array = 817 Match! Avg = 6.142857142857143 Approximate low value of avg = 6.066089190457772 Approximate high value of avg = 6.166089190457772 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(133) = 950 >>> Theoretic accumulative number of comps in unsuccessful searches in an 133-element array = 950 Match! Avg = 7.08955223880597 Approximate low value of avg = 7.066089190457772 Approximate high value of avg = 7.166089190457772 Fits in! Difference between the unsuccessful and successful = 0.9466950959488267 *** 134-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(134) = 825 >>> Theoretic accumulative number of comps in successful searches in an 134-element array = 825 Match! Avg = 6.156716417910448 Approximate low value of avg = 6.076815597050832 Approximate high value of avg = 6.176815597050831 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(134) = 959 >>> Theoretic accumulative number of comps in unsuccessful searches in an 134-element array = 959 Match! Avg = 7.103703703703704 Approximate low value of avg = 7.076815597050832 Approximate high value of avg = 7.176815597050831 Fits in! Difference between the unsuccessful and successful = 0.9469872857932558 *** 135-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(135) = 833 >>> Theoretic accumulative number of comps in successful searches in an 135-element array = 833 Match! Avg = 6.17037037037037 Approximate low value of avg = 6.08746284125034 Approximate high value of avg = 6.18746284125034 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(135) = 968 >>> Theoretic accumulative number of comps in unsuccessful searches in an 135-element array = 968 Match! Avg = 7.117647058823529 Approximate low value of avg = 7.08746284125034 Approximate high value of avg = 7.18746284125034 Fits in! Difference between the unsuccessful and successful = 0.9472766884531589 *** 136-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(136) = 841 >>> Theoretic accumulative number of comps in successful searches in an 136-element array = 841 Match! Avg = 6.1838235294117645 Approximate low value of avg = 6.098032082960527 Approximate high value of avg = 6.198032082960527 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(136) = 977 >>> Theoretic accumulative number of comps in unsuccessful searches in an 136-element array = 977 Match! Avg = 7.131386861313868 Approximate low value of avg = 7.098032082960527 Approximate high value of avg = 7.198032082960527 Fits in! Difference between the unsuccessful and successful = 0.9475633319021037 *** 137-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(137) = 849 >>> Theoretic accumulative number of comps in successful searches in an 137-element array = 849 Match! Avg = 6.197080291970803 Approximate low value of avg = 6.10852445677817 Approximate high value of avg = 6.20852445677817 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(137) = 986 >>> Theoretic accumulative number of comps in unsuccessful searches in an 137-element array = 986 Match! Avg = 7.144927536231884 Approximate low value of avg = 7.10852445677817 Approximate high value of avg = 7.20852445677817 Fits in! Difference between the unsuccessful and successful = 0.947847244261081 *** 138-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(138) = 857 >>> Theoretic accumulative number of comps in successful searches in an 138-element array = 857 Match! Avg = 6.2101449275362315 Approximate low value of avg = 6.118941072723508 Approximate high value of avg = 6.218941072723507 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(138) = 995 >>> Theoretic accumulative number of comps in unsuccessful searches in an 138-element array = 995 Match! Avg = 7.158273381294964 Approximate low value of avg = 7.118941072723508 Approximate high value of avg = 7.218941072723507 Fits in! Difference between the unsuccessful and successful = 0.9481284537587324 *** 139-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(139) = 865 >>> Theoretic accumulative number of comps in successful searches in an 139-element array = 865 Match! Avg = 6.223021582733813 Approximate low value of avg = 6.129283016944966 Approximate high value of avg = 6.229283016944966 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(139) = 1004 >>> Theoretic accumulative number of comps in unsuccessful searches in an 139-element array = 1004 Match! Avg = 7.171428571428572 Approximate low value of avg = 7.129283016944966 Approximate high value of avg = 7.229283016944966 Fits in! Difference between the unsuccessful and successful = 0.9484069886947584 *** 140-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(140) = 873 >>> Theoretic accumulative number of comps in successful searches in an 140-element array = 873 Match! Avg = 6.235714285714286 Approximate low value of avg = 6.139551352398794 Approximate high value of avg = 6.239551352398793 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(140) = 1013 >>> Theoretic accumulative number of comps in unsuccessful searches in an 140-element array = 1013 Match! Avg = 7.184397163120567 Approximate low value of avg = 7.139551352398794 Approximate high value of avg = 7.239551352398793 Fits in! Difference between the unsuccessful and successful = 0.9486828774062817 *** 141-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(141) = 881 >>> Theoretic accumulative number of comps in successful searches in an 141-element array = 881 Match! Avg = 6.24822695035461 Approximate low value of avg = 6.149747119504682 Approximate high value of avg = 6.249747119504682 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(141) = 1022 >>> Theoretic accumulative number of comps in unsuccessful searches in an 141-element array = 1022 Match! Avg = 7.197183098591549 Approximate low value of avg = 7.149747119504682 Approximate high value of avg = 7.249747119504682 Fits in! Difference between the unsuccessful and successful = 0.9489561482369391 *** 142-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(142) = 889 >>> Theoretic accumulative number of comps in successful searches in an 142-element array = 889 Match! Avg = 6.26056338028169 Approximate low value of avg = 6.159871336778389 Approximate high value of avg = 6.259871336778389 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(142) = 1031 >>> Theoretic accumulative number of comps in unsuccessful searches in an 142-element array = 1031 Match! Avg = 7.20979020979021 Approximate low value of avg = 7.159871336778389 Approximate high value of avg = 7.259871336778389 Fits in! Difference between the unsuccessful and successful = 0.94922682950852 *** 143-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(143) = 897 >>> Theoretic accumulative number of comps in successful searches in an 143-element array = 897 Match! Avg = 6.2727272727272725 Approximate low value of avg = 6.169925001442313 Approximate high value of avg = 6.269925001442313 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(143) = 1040 >>> Theoretic accumulative number of comps in unsuccessful searches in an 143-element array = 1040 Match! Avg = 7.222222222222222 Approximate low value of avg = 7.169925001442313 Approximate high value of avg = 7.269925001442313 Fits in! Difference between the unsuccessful and successful = 0.9494949494949498 *** 144-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(144) = 905 >>> Theoretic accumulative number of comps in successful searches in an 144-element array = 905 Match! Avg = 6.284722222222222 Approximate low value of avg = 6.1799090900149345 Approximate high value of avg = 6.279909090014934 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(144) = 1049 >>> Theoretic accumulative number of comps in unsuccessful searches in an 144-element array = 1049 Match! Avg = 7.23448275862069 Approximate low value of avg = 7.1799090900149345 Approximate high value of avg = 7.279909090014934 Fits in! Difference between the unsuccessful and successful = 0.9497605363984674 *** 145-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(145) = 913 >>> Theoretic accumulative number of comps in successful searches in an 145-element array = 913 Match! Avg = 6.296551724137931 Approximate low value of avg = 6.189824558880018 Approximate high value of avg = 6.289824558880017 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(145) = 1058 >>> Theoretic accumulative number of comps in unsuccessful searches in an 145-element array = 1058 Match! Avg = 7.2465753424657535 Approximate low value of avg = 7.189824558880018 Approximate high value of avg = 7.289824558880017 Fits in! Difference between the unsuccessful and successful = 0.9500236183278226 *** 146-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(146) = 921 >>> Theoretic accumulative number of comps in successful searches in an 146-element array = 921 Match! Avg = 6.308219178082192 Approximate low value of avg = 6.199672344836364 Approximate high value of avg = 6.299672344836364 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(146) = 1067 >>> Theoretic accumulative number of comps in unsuccessful searches in an 146-element array = 1067 Match! Avg = 7.258503401360544 Approximate low value of avg = 7.199672344836364 Approximate high value of avg = 7.299672344836364 Fits in! Difference between the unsuccessful and successful = 0.9502842232783522 *** 147-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(147) = 929 >>> Theoretic accumulative number of comps in successful searches in an 147-element array = 929 Match! Avg = 6.319727891156463 Approximate low value of avg = 6.209453365628949 Approximate high value of avg = 6.309453365628949 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(147) = 1076 >>> Theoretic accumulative number of comps in unsuccessful searches in an 147-element array = 1076 Match! Avg = 7.27027027027027 Approximate low value of avg = 7.209453365628949 Approximate high value of avg = 7.309453365628949 Fits in! Difference between the unsuccessful and successful = 0.9505423791138075 *** 148-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(148) = 937 >>> Theoretic accumulative number of comps in successful searches in an 148-element array = 937 Match! Avg = 6.331081081081081 Approximate low value of avg = 6.219168520462162 Approximate high value of avg = 6.319168520462162 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(148) = 1085 >>> Theoretic accumulative number of comps in unsuccessful searches in an 148-element array = 1085 Match! Avg = 7.281879194630872 Approximate low value of avg = 7.219168520462162 Approximate high value of avg = 7.319168520462162 Fits in! Difference between the unsuccessful and successful = 0.9507981135497916 *** 149-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(149) = 945 >>> Theoretic accumulative number of comps in successful searches in an 149-element array = 945 Match! Avg = 6.342281879194631 Approximate low value of avg = 6.22881869049588 Approximate high value of avg = 6.32881869049588 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(149) = 1094 >>> Theoretic accumulative number of comps in unsuccessful searches in an 149-element array = 1094 Match! Avg = 7.293333333333333 Approximate low value of avg = 7.22881869049588 Approximate high value of avg = 7.32881869049588 Fits in! Difference between the unsuccessful and successful = 0.9510514541387023 *** 150-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(150) = 953 >>> Theoretic accumulative number of comps in successful searches in an 150-element array = 953 Match! Avg = 6.3533333333333335 Approximate low value of avg = 6.238404739325079 Approximate high value of avg = 6.338404739325079 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(150) = 1103 >>> Theoretic accumulative number of comps in unsuccessful searches in an 150-element array = 1103 Match! Avg = 7.304635761589404 Approximate low value of avg = 7.238404739325079 Approximate high value of avg = 7.338404739325079 Fits in! Difference between the unsuccessful and successful = 0.9513024282560707 *** 151-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(151) = 961 >>> Theoretic accumulative number of comps in successful searches in an 151-element array = 961 Match! Avg = 6.364238410596027 Approximate low value of avg = 6.247927513443586 Approximate high value of avg = 6.347927513443586 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(151) = 1112 >>> Theoretic accumulative number of comps in unsuccessful searches in an 151-element array = 1112 Match! Avg = 7.315789473684211 Approximate low value of avg = 7.247927513443586 Approximate high value of avg = 7.347927513443586 Fits in! Difference between the unsuccessful and successful = 0.9515510630881838 *** 152-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(152) = 969 >>> Theoretic accumulative number of comps in successful searches in an 152-element array = 969 Match! Avg = 6.375 Approximate low value of avg = 6.257387842692652 Approximate high value of avg = 6.357387842692652 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(152) = 1121 >>> Theoretic accumulative number of comps in unsuccessful searches in an 152-element array = 1121 Match! Avg = 7.326797385620915 Approximate low value of avg = 7.257387842692652 Approximate high value of avg = 7.357387842692652 Fits in! Difference between the unsuccessful and successful = 0.9517973856209148 *** 153-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(153) = 977 >>> Theoretic accumulative number of comps in successful searches in an 153-element array = 977 Match! Avg = 6.38562091503268 Approximate low value of avg = 6.266786540694902 Approximate high value of avg = 6.366786540694902 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(153) = 1130 >>> Theoretic accumulative number of comps in unsuccessful searches in an 153-element array = 1130 Match! Avg = 7.337662337662338 Approximate low value of avg = 7.266786540694902 Approximate high value of avg = 7.366786540694902 Fits in! Difference between the unsuccessful and successful = 0.9520414226296579 *** 154-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(154) = 985 >>> Theoretic accumulative number of comps in successful searches in an 154-element array = 985 Match! Avg = 6.396103896103896 Approximate low value of avg = 6.276124405274238 Approximate high value of avg = 6.376124405274238 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(154) = 1139 >>> Theoretic accumulative number of comps in unsuccessful searches in an 154-element array = 1139 Match! Avg = 7.348387096774194 Approximate low value of avg = 7.276124405274238 Approximate high value of avg = 7.376124405274238 Fits in! Difference between the unsuccessful and successful = 0.9522832006702977 *** 155-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(155) = 993 >>> Theoretic accumulative number of comps in successful searches in an 155-element array = 993 Match! Avg = 6.406451612903226 Approximate low value of avg = 6.285402218862249 Approximate high value of avg = 6.385402218862248 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(155) = 1148 >>> Theoretic accumulative number of comps in unsuccessful searches in an 155-element array = 1148 Match! Avg = 7.358974358974359 Approximate low value of avg = 7.285402218862249 Approximate high value of avg = 7.385402218862248 Fits in! Difference between the unsuccessful and successful = 0.952522746071133 *** 156-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(156) = 1001 >>> Theoretic accumulative number of comps in successful searches in an 156-element array = 1001 Match! Avg = 6.416666666666667 Approximate low value of avg = 6.294620748891627 Approximate high value of avg = 6.394620748891627 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(156) = 1157 >>> Theoretic accumulative number of comps in unsuccessful searches in an 156-element array = 1157 Match! Avg = 7.369426751592357 Approximate low value of avg = 7.294620748891627 Approximate high value of avg = 7.394620748891627 Fits in! Difference between the unsuccessful and successful = 0.9527600849256901 *** 157-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(157) = 1009 >>> Theoretic accumulative number of comps in successful searches in an 157-element array = 1009 Match! Avg = 6.426751592356688 Approximate low value of avg = 6.303780748177103 Approximate high value of avg = 6.403780748177103 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(157) = 1166 >>> Theoretic accumulative number of comps in unsuccessful searches in an 157-element array = 1166 Match! Avg = 7.379746835443038 Approximate low value of avg = 7.303780748177103 Approximate high value of avg = 7.403780748177103 Fits in! Difference between the unsuccessful and successful = 0.9529952430863506 *** 158-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(158) = 1017 >>> Theoretic accumulative number of comps in successful searches in an 158-element array = 1017 Match! Avg = 6.436708860759493 Approximate low value of avg = 6.312882955284356 Approximate high value of avg = 6.412882955284355 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(158) = 1175 >>> Theoretic accumulative number of comps in unsuccessful searches in an 158-element array = 1175 Match! Avg = 7.389937106918239 Approximate low value of avg = 7.312882955284356 Approximate high value of avg = 7.412882955284355 Fits in! Difference between the unsuccessful and successful = 0.953228246158746 *** 159-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(159) = 1025 >>> Theoretic accumulative number of comps in successful searches in an 159-element array = 1025 Match! Avg = 6.446540880503145 Approximate low value of avg = 6.321928094887362 Approximate high value of avg = 6.421928094887361 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(159) = 1184 >>> Theoretic accumulative number of comps in unsuccessful searches in an 159-element array = 1184 Match! Avg = 7.4 Approximate low value of avg = 7.321928094887362 Approximate high value of avg = 7.421928094887361 Fits in! Difference between the unsuccessful and successful = 0.9534591194968556 *** 160-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(160) = 1033 >>> Theoretic accumulative number of comps in successful searches in an 160-element array = 1033 Match! Avg = 6.45625 Approximate low value of avg = 6.330916878114618 Approximate high value of avg = 6.430916878114617 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(160) = 1193 >>> Theoretic accumulative number of comps in unsuccessful searches in an 160-element array = 1193 Match! Avg = 7.409937888198757 Approximate low value of avg = 7.330916878114618 Approximate high value of avg = 7.430916878114617 Fits in! Difference between the unsuccessful and successful = 0.9536878881987576 *** 161-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(161) = 1041 >>> Theoretic accumulative number of comps in successful searches in an 161-element array = 1041 Match! Avg = 6.46583850931677 Approximate low value of avg = 6.339850002884624 Approximate high value of avg = 6.439850002884624 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(161) = 1202 >>> Theoretic accumulative number of comps in unsuccessful searches in an 161-element array = 1202 Match! Avg = 7.419753086419753 Approximate low value of avg = 7.339850002884624 Approximate high value of avg = 7.439850002884624 Fits in! Difference between the unsuccessful and successful = 0.9539145771029833 *** 162-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(162) = 1049 >>> Theoretic accumulative number of comps in successful searches in an 162-element array = 1049 Match! Avg = 6.4753086419753085 Approximate low value of avg = 6.348728154231078 Approximate high value of avg = 6.448728154231078 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(162) = 1211 >>> Theoretic accumulative number of comps in unsuccessful searches in an 162-element array = 1211 Match! Avg = 7.429447852760736 Approximate low value of avg = 7.348728154231078 Approximate high value of avg = 7.448728154231078 Fits in! Difference between the unsuccessful and successful = 0.9541392107854278 *** 163-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(163) = 1057 >>> Theoretic accumulative number of comps in successful searches in an 163-element array = 1057 Match! Avg = 6.484662576687117 Approximate low value of avg = 6.357552004618085 Approximate high value of avg = 6.457552004618084 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(163) = 1220 >>> Theoretic accumulative number of comps in unsuccessful searches in an 163-element array = 1220 Match! Avg = 7.439024390243903 Approximate low value of avg = 7.357552004618085 Approximate high value of avg = 7.457552004618084 Fits in! Difference between the unsuccessful and successful = 0.954361813556786 *** 164-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(164) = 1065 >>> Theoretic accumulative number of comps in successful searches in an 164-element array = 1065 Match! Avg = 6.4939024390243905 Approximate low value of avg = 6.366322214245815 Approximate high value of avg = 6.466322214245815 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(164) = 1229 >>> Theoretic accumulative number of comps in unsuccessful searches in an 164-element array = 1229 Match! Avg = 7.448484848484848 Approximate low value of avg = 7.366322214245815 Approximate high value of avg = 7.466322214245815 Fits in! Difference between the unsuccessful and successful = 0.9545824094604578 *** 165-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(165) = 1073 >>> Theoretic accumulative number of comps in successful searches in an 165-element array = 1073 Match! Avg = 6.503030303030303 Approximate low value of avg = 6.375039431346925 Approximate high value of avg = 6.475039431346925 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(165) = 1238 >>> Theoretic accumulative number of comps in unsuccessful searches in an 165-element array = 1238 Match! Avg = 7.457831325301205 Approximate low value of avg = 7.375039431346925 Approximate high value of avg = 7.475039431346925 Fits in! Difference between the unsuccessful and successful = 0.9548010222709022 *** 166-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(166) = 1081 >>> Theoretic accumulative number of comps in successful searches in an 166-element array = 1081 Match! Avg = 6.5120481927710845 Approximate low value of avg = 6.383704292474053 Approximate high value of avg = 6.4837042924740524 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(166) = 1247 >>> Theoretic accumulative number of comps in unsuccessful searches in an 166-element array = 1247 Match! Avg = 7.467065868263473 Approximate low value of avg = 7.383704292474053 Approximate high value of avg = 7.4837042924740524 Fits in! Difference between the unsuccessful and successful = 0.9550176754923889 *** 167-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(167) = 1089 >>> Theoretic accumulative number of comps in successful searches in an 167-element array = 1089 Match! Avg = 6.520958083832335 Approximate low value of avg = 6.392317422778761 Approximate high value of avg = 6.49231742277876 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(167) = 1256 >>> Theoretic accumulative number of comps in unsuccessful searches in an 167-element array = 1256 Match! Avg = 7.476190476190476 Approximate low value of avg = 7.392317422778761 Approximate high value of avg = 7.49231742277876 Fits in! Difference between the unsuccessful and successful = 0.9552323923581412 *** 168-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(168) = 1097 >>> Theoretic accumulative number of comps in successful searches in an 168-element array = 1097 Match! Avg = 6.529761904761905 Approximate low value of avg = 6.400879436282184 Approximate high value of avg = 6.500879436282184 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(168) = 1265 >>> Theoretic accumulative number of comps in unsuccessful searches in an 168-element array = 1265 Match! Avg = 7.485207100591716 Approximate low value of avg = 7.400879436282184 Approximate high value of avg = 7.500879436282184 Fits in! Difference between the unsuccessful and successful = 0.9554451958298111 *** 169-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(169) = 1105 >>> Theoretic accumulative number of comps in successful searches in an 169-element array = 1105 Match! Avg = 6.538461538461538 Approximate low value of avg = 6.409390936137703 Approximate high value of avg = 6.509390936137702 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(169) = 1274 >>> Theoretic accumulative number of comps in unsuccessful searches in an 169-element array = 1274 Match! Avg = 7.4941176470588236 Approximate low value of avg = 7.409390936137703 Approximate high value of avg = 7.509390936137702 Fits in! Difference between the unsuccessful and successful = 0.9556561085972852 *** 170-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(170) = 1113 >>> Theoretic accumulative number of comps in successful searches in an 170-element array = 1113 Match! Avg = 6.547058823529412 Approximate low value of avg = 6.417852514885899 Approximate high value of avg = 6.517852514885899 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(170) = 1283 >>> Theoretic accumulative number of comps in unsuccessful searches in an 170-element array = 1283 Match! Avg = 7.502923976608187 Approximate low value of avg = 7.417852514885899 Approximate high value of avg = 7.517852514885899 Fits in! Difference between the unsuccessful and successful = 0.9558651530787756 *** 171-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(171) = 1121 >>> Theoretic accumulative number of comps in successful searches in an 171-element array = 1121 Match! Avg = 6.555555555555555 Approximate low value of avg = 6.426264754702098 Approximate high value of avg = 6.5262647547020975 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(171) = 1292 >>> Theoretic accumulative number of comps in unsuccessful searches in an 171-element array = 1292 Match! Avg = 7.511627906976744 Approximate low value of avg = 7.426264754702098 Approximate high value of avg = 7.5262647547020975 Fits in! Difference between the unsuccessful and successful = 0.9560723514211888 *** 172-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(172) = 1129 >>> Theoretic accumulative number of comps in successful searches in an 172-element array = 1129 Match! Avg = 6.563953488372093 Approximate low value of avg = 6.4346282276367255 Approximate high value of avg = 6.534628227636725 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(172) = 1301 >>> Theoretic accumulative number of comps in unsuccessful searches in an 172-element array = 1301 Match! Avg = 7.520231213872832 Approximate low value of avg = 7.4346282276367255 Approximate high value of avg = 7.534628227636725 Fits in! Difference between the unsuccessful and successful = 0.9562777255007395 *** 173-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(173) = 1137 >>> Theoretic accumulative number of comps in successful searches in an 173-element array = 1137 Match! Avg = 6.572254335260116 Approximate low value of avg = 6.442943495848729 Approximate high value of avg = 6.5429434958487285 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(173) = 1310 >>> Theoretic accumulative number of comps in unsuccessful searches in an 173-element array = 1310 Match! Avg = 7.528735632183908 Approximate low value of avg = 7.442943495848729 Approximate high value of avg = 7.5429434958487285 Fits in! Difference between the unsuccessful and successful = 0.9564812969237924 *** 174-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(174) = 1145 >>> Theoretic accumulative number of comps in successful searches in an 174-element array = 1145 Match! Avg = 6.580459770114943 Approximate low value of avg = 6.45121111183233 Approximate high value of avg = 6.5512111118323295 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(174) = 1319 >>> Theoretic accumulative number of comps in unsuccessful searches in an 174-element array = 1319 Match! Avg = 7.537142857142857 Approximate low value of avg = 7.45121111183233 Approximate high value of avg = 7.5512111118323295 Fits in! Difference between the unsuccessful and successful = 0.9566830870279146 *** 175-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(175) = 1153 >>> Theoretic accumulative number of comps in successful searches in an 175-element array = 1153 Match! Avg = 6.588571428571429 Approximate low value of avg = 6.459431618637297 Approximate high value of avg = 6.559431618637297 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(175) = 1328 >>> Theoretic accumulative number of comps in unsuccessful searches in an 175-element array = 1328 Match! Avg = 7.545454545454546 Approximate low value of avg = 7.459431618637297 Approximate high value of avg = 7.559431618637297 Fits in! Difference between the unsuccessful and successful = 0.9568831168831169 *** 176-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(176) = 1161 >>> Theoretic accumulative number of comps in successful searches in an 176-element array = 1161 Match! Avg = 6.596590909090909 Approximate low value of avg = 6.467605550082998 Approximate high value of avg = 6.567605550082997 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(176) = 1337 >>> Theoretic accumulative number of comps in unsuccessful searches in an 176-element array = 1337 Match! Avg = 7.553672316384181 Approximate low value of avg = 7.467605550082998 Approximate high value of avg = 7.567605550082997 Fits in! Difference between the unsuccessful and successful = 0.9570814072932716 *** 177-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(177) = 1169 >>> Theoretic accumulative number of comps in successful searches in an 177-element array = 1169 Match! Avg = 6.604519774011299 Approximate low value of avg = 6.475733430966398 Approximate high value of avg = 6.575733430966397 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(177) = 1346 >>> Theoretic accumulative number of comps in unsuccessful searches in an 177-element array = 1346 Match! Avg = 7.561797752808989 Approximate low value of avg = 7.475733430966398 Approximate high value of avg = 7.575733430966397 Fits in! Difference between the unsuccessful and successful = 0.9572779787976895 *** 178-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(178) = 1177 >>> Theoretic accumulative number of comps in successful searches in an 178-element array = 1177 Match! Avg = 6.612359550561798 Approximate low value of avg = 6.483815777264256 Approximate high value of avg = 6.583815777264256 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(178) = 1355 >>> Theoretic accumulative number of comps in unsuccessful searches in an 178-element array = 1355 Match! Avg = 7.569832402234637 Approximate low value of avg = 7.483815777264256 Approximate high value of avg = 7.583815777264256 Fits in! Difference between the unsuccessful and successful = 0.957472851672839 *** 179-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(179) = 1185 >>> Theoretic accumulative number of comps in successful searches in an 179-element array = 1185 Match! Avg = 6.620111731843576 Approximate low value of avg = 6.491853096329675 Approximate high value of avg = 6.591853096329674 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(179) = 1364 >>> Theoretic accumulative number of comps in unsuccessful searches in an 179-element array = 1364 Match! Avg = 7.5777777777777775 Approximate low value of avg = 7.491853096329675 Approximate high value of avg = 7.591853096329674 Fits in! Difference between the unsuccessful and successful = 0.9576660459342019 *** 180-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(180) = 1193 >>> Theoretic accumulative number of comps in successful searches in an 180-element array = 1193 Match! Avg = 6.627777777777778 Approximate low value of avg = 6.499845887083206 Approximate high value of avg = 6.599845887083205 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(180) = 1373 >>> Theoretic accumulative number of comps in unsuccessful searches in an 180-element array = 1373 Match! Avg = 7.585635359116022 Approximate low value of avg = 7.499845887083206 Approximate high value of avg = 7.599845887083205 Fits in! Difference between the unsuccessful and successful = 0.957857581338244 *** 181-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(181) = 1201 >>> Theoretic accumulative number of comps in successful searches in an 181-element array = 1201 Match! Avg = 6.6353591160221 Approximate low value of avg = 6.507794640198696 Approximate high value of avg = 6.607794640198696 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(181) = 1382 >>> Theoretic accumulative number of comps in unsuccessful searches in an 181-element array = 1382 Match! Avg = 7.593406593406593 Approximate low value of avg = 7.507794640198696 Approximate high value of avg = 7.607794640198696 Fits in! Difference between the unsuccessful and successful = 0.9580474773844934 *** 182-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(182) = 1209 >>> Theoretic accumulative number of comps in successful searches in an 182-element array = 1209 Match! Avg = 6.642857142857143 Approximate low value of avg = 6.515699838284044 Approximate high value of avg = 6.615699838284043 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(182) = 1391 >>> Theoretic accumulative number of comps in unsuccessful searches in an 182-element array = 1391 Match! Avg = 7.601092896174864 Approximate low value of avg = 7.515699838284044 Approximate high value of avg = 7.615699838284043 Fits in! Difference between the unsuccessful and successful = 0.9582357533177204 *** 183-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(183) = 1217 >>> Theoretic accumulative number of comps in successful searches in an 183-element array = 1217 Match! Avg = 6.6502732240437155 Approximate low value of avg = 6.523561956057013 Approximate high value of avg = 6.623561956057013 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(183) = 1400 >>> Theoretic accumulative number of comps in unsuccessful searches in an 183-element array = 1400 Match! Avg = 7.608695652173913 Approximate low value of avg = 7.523561956057013 Approximate high value of avg = 7.623561956057013 Fits in! Difference between the unsuccessful and successful = 0.9584224281301976 *** 184-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(184) = 1225 >>> Theoretic accumulative number of comps in successful searches in an 184-element array = 1225 Match! Avg = 6.657608695652174 Approximate low value of avg = 6.531381460516312 Approximate high value of avg = 6.6313814605163115 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(184) = 1409 >>> Theoretic accumulative number of comps in unsuccessful searches in an 184-element array = 1409 Match! Avg = 7.616216216216216 Approximate low value of avg = 7.531381460516312 Approximate high value of avg = 7.6313814605163115 Fits in! Difference between the unsuccessful and successful = 0.9586075205640423 *** 185-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(185) = 1233 >>> Theoretic accumulative number of comps in successful searches in an 185-element array = 1233 Match! Avg = 6.664864864864865 Approximate low value of avg = 6.539158811108032 Approximate high value of avg = 6.6391588111080315 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(185) = 1418 >>> Theoretic accumulative number of comps in unsuccessful searches in an 185-element array = 1418 Match! Avg = 7.623655913978495 Approximate low value of avg = 7.539158811108032 Approximate high value of avg = 7.6391588111080315 Fits in! Difference between the unsuccessful and successful = 0.9587910491136302 *** 186-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(186) = 1241 >>> Theoretic accumulative number of comps in successful searches in an 186-element array = 1241 Match! Avg = 6.672043010752688 Approximate low value of avg = 6.546894459887637 Approximate high value of avg = 6.646894459887637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(186) = 1427 >>> Theoretic accumulative number of comps in unsuccessful searches in an 186-element array = 1427 Match! Avg = 7.6310160427807485 Approximate low value of avg = 7.546894459887637 Approximate high value of avg = 7.646894459887637 Fits in! Difference between the unsuccessful and successful = 0.9589730320280605 *** 187-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(187) = 1249 >>> Theoretic accumulative number of comps in successful searches in an 187-element array = 1249 Match! Avg = 6.679144385026738 Approximate low value of avg = 6.554588851677638 Approximate high value of avg = 6.654588851677637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(187) = 1436 >>> Theoretic accumulative number of comps in unsuccessful searches in an 187-element array = 1436 Match! Avg = 7.638297872340425 Approximate low value of avg = 7.554588851677638 Approximate high value of avg = 7.654588851677637 Fits in! Difference between the unsuccessful and successful = 0.9591534873136878 *** 188-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(188) = 1257 >>> Theoretic accumulative number of comps in successful searches in an 188-element array = 1257 Match! Avg = 6.6861702127659575 Approximate low value of avg = 6.562242424221073 Approximate high value of avg = 6.6622424242210725 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(188) = 1445 >>> Theoretic accumulative number of comps in unsuccessful searches in an 188-element array = 1445 Match! Avg = 7.645502645502646 Approximate low value of avg = 7.562242424221073 Approximate high value of avg = 7.6622424242210725 Fits in! Difference between the unsuccessful and successful = 0.9593324327366881 *** 189-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(189) = 1265 >>> Theoretic accumulative number of comps in successful searches in an 189-element array = 1265 Match! Avg = 6.693121693121693 Approximate low value of avg = 6.569855608330948 Approximate high value of avg = 6.6698556083309475 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(189) = 1454 >>> Theoretic accumulative number of comps in unsuccessful searches in an 189-element array = 1454 Match! Avg = 7.652631578947369 Approximate low value of avg = 7.569855608330948 Approximate high value of avg = 7.6698556083309475 Fits in! Difference between the unsuccessful and successful = 0.9595098858256756 *** 190-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(190) = 1273 >>> Theoretic accumulative number of comps in successful searches in an 190-element array = 1273 Match! Avg = 6.7 Approximate low value of avg = 6.577428828035749 Approximate high value of avg = 6.677428828035748 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(190) = 1463 >>> Theoretic accumulative number of comps in unsuccessful searches in an 190-element array = 1463 Match! Avg = 7.659685863874346 Approximate low value of avg = 7.577428828035749 Approximate high value of avg = 7.677428828035748 Fits in! Difference between the unsuccessful and successful = 0.9596858638743457 *** 191-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(191) = 1281 >>> Theoretic accumulative number of comps in successful searches in an 191-element array = 1281 Match! Avg = 6.706806282722513 Approximate low value of avg = 6.584962500721156 Approximate high value of avg = 6.684962500721156 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(191) = 1472 >>> Theoretic accumulative number of comps in unsuccessful searches in an 191-element array = 1472 Match! Avg = 7.666666666666667 Approximate low value of avg = 7.584962500721156 Approximate high value of avg = 7.684962500721156 Fits in! Difference between the unsuccessful and successful = 0.9598603839441537 *** 192-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(192) = 1289 >>> Theoretic accumulative number of comps in successful searches in an 192-element array = 1289 Match! Avg = 6.713541666666667 Approximate low value of avg = 6.592457037268081 Approximate high value of avg = 6.69245703726808 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(192) = 1481 >>> Theoretic accumulative number of comps in unsuccessful searches in an 192-element array = 1481 Match! Avg = 7.6735751295336785 Approximate low value of avg = 7.592457037268081 Approximate high value of avg = 7.69245703726808 Fits in! Difference between the unsuccessful and successful = 0.9600334628670115 *** 193-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(193) = 1297 >>> Theoretic accumulative number of comps in successful searches in an 193-element array = 1297 Match! Avg = 6.72020725388601 Approximate low value of avg = 6.599912842187128 Approximate high value of avg = 6.6999128421871275 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(193) = 1490 >>> Theoretic accumulative number of comps in unsuccessful searches in an 193-element array = 1490 Match! Avg = 7.680412371134021 Approximate low value of avg = 7.599912842187128 Approximate high value of avg = 7.6999128421871275 Fits in! Difference between the unsuccessful and successful = 0.9602051172480106 *** 194-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(194) = 1305 >>> Theoretic accumulative number of comps in successful searches in an 194-element array = 1305 Match! Avg = 6.72680412371134 Approximate low value of avg = 6.607330313749611 Approximate high value of avg = 6.707330313749611 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(194) = 1499 >>> Theoretic accumulative number of comps in unsuccessful searches in an 194-element array = 1499 Match! Avg = 7.687179487179487 Approximate low value of avg = 7.607330313749611 Approximate high value of avg = 7.707330313749611 Fits in! Difference between the unsuccessful and successful = 0.9603753634681471 *** 195-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(195) = 1313 >>> Theoretic accumulative number of comps in successful searches in an 195-element array = 1313 Match! Avg = 6.733333333333333 Approximate low value of avg = 6.6147098441152075 Approximate high value of avg = 6.714709844115207 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(195) = 1508 >>> Theoretic accumulative number of comps in unsuccessful searches in an 195-element array = 1508 Match! Avg = 7.6938775510204085 Approximate low value of avg = 7.6147098441152075 Approximate high value of avg = 7.714709844115207 Fits in! Difference between the unsuccessful and successful = 0.9605442176870751 *** 196-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(196) = 1321 >>> Theoretic accumulative number of comps in successful searches in an 196-element array = 1321 Match! Avg = 6.739795918367347 Approximate low value of avg = 6.622051819456376 Approximate high value of avg = 6.722051819456376 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(196) = 1517 >>> Theoretic accumulative number of comps in unsuccessful searches in an 196-element array = 1517 Match! Avg = 7.700507614213198 Approximate low value of avg = 7.622051819456376 Approximate high value of avg = 7.722051819456376 Fits in! Difference between the unsuccessful and successful = 0.960711695845851 *** 197-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(197) = 1329 >>> Theoretic accumulative number of comps in successful searches in an 197-element array = 1329 Match! Avg = 6.746192893401015 Approximate low value of avg = 6.6293566200796095 Approximate high value of avg = 6.729356620079609 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(197) = 1526 >>> Theoretic accumulative number of comps in unsuccessful searches in an 197-element array = 1526 Match! Avg = 7.707070707070707 Approximate low value of avg = 7.6293566200796095 Approximate high value of avg = 7.729356620079609 Fits in! Difference between the unsuccessful and successful = 0.9608778136696916 *** 198-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(198) = 1337 >>> Theoretic accumulative number of comps in successful searches in an 198-element array = 1337 Match! Avg = 6.752525252525253 Approximate low value of avg = 6.636624620543649 Approximate high value of avg = 6.736624620543648 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(198) = 1535 >>> Theoretic accumulative number of comps in unsuccessful searches in an 198-element array = 1535 Match! Avg = 7.71356783919598 Approximate low value of avg = 7.636624620543649 Approximate high value of avg = 7.736624620543648 Fits in! Difference between the unsuccessful and successful = 0.9610425866707271 *** 199-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(199) = 1345 >>> Theoretic accumulative number of comps in successful searches in an 199-element array = 1345 Match! Avg = 6.758793969849246 Approximate low value of avg = 6.643856189774724 Approximate high value of avg = 6.743856189774724 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(199) = 1544 >>> Theoretic accumulative number of comps in unsuccessful searches in an 199-element array = 1544 Match! Avg = 7.72 Approximate low value of avg = 7.643856189774724 Approximate high value of avg = 7.743856189774724 Fits in! Difference between the unsuccessful and successful = 0.9612060301507537 *** 200-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(200) = 1353 >>> Theoretic accumulative number of comps in successful searches in an 200-element array = 1353 Match! Avg = 6.765 Approximate low value of avg = 6.651051691178929 Approximate high value of avg = 6.751051691178929 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(200) = 1553 >>> Theoretic accumulative number of comps in unsuccessful searches in an 200-element array = 1553 Match! Avg = 7.72636815920398 Approximate low value of avg = 7.651051691178929 Approximate high value of avg = 7.751051691178929 Fits in! Difference between the unsuccessful and successful = 0.96136815920398 *** 201-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(201) = 1361 >>> Theoretic accumulative number of comps in successful searches in an 201-element array = 1361 Match! Avg = 6.7711442786069655 Approximate low value of avg = 6.6582114827517955 Approximate high value of avg = 6.758211482751795 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(201) = 1562 >>> Theoretic accumulative number of comps in unsuccessful searches in an 201-element array = 1562 Match! Avg = 7.732673267326732 Approximate low value of avg = 7.6582114827517955 Approximate high value of avg = 7.758211482751795 Fits in! Difference between the unsuccessful and successful = 0.9615289887197669 *** 202-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(202) = 1369 >>> Theoretic accumulative number of comps in successful searches in an 202-element array = 1369 Match! Avg = 6.7772277227722775 Approximate low value of avg = 6.6653359171851765 Approximate high value of avg = 6.765335917185176 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(202) = 1571 >>> Theoretic accumulative number of comps in unsuccessful searches in an 202-element array = 1571 Match! Avg = 7.738916256157635 Approximate low value of avg = 7.6653359171851765 Approximate high value of avg = 7.765335917185176 Fits in! Difference between the unsuccessful and successful = 0.9616885333853578 *** 203-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(203) = 1377 >>> Theoretic accumulative number of comps in successful searches in an 203-element array = 1377 Match! Avg = 6.783251231527093 Approximate low value of avg = 6.672425341971495 Approximate high value of avg = 6.772425341971495 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(203) = 1580 >>> Theoretic accumulative number of comps in unsuccessful searches in an 203-element array = 1580 Match! Avg = 7.745098039215686 Approximate low value of avg = 7.672425341971495 Approximate high value of avg = 7.772425341971495 Fits in! Difference between the unsuccessful and successful = 0.9618468076885929 *** 204-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(204) = 1385 >>> Theoretic accumulative number of comps in successful searches in an 204-element array = 1385 Match! Avg = 6.78921568627451 Approximate low value of avg = 6.679480099505446 Approximate high value of avg = 6.779480099505446 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(204) = 1589 >>> Theoretic accumulative number of comps in unsuccessful searches in an 204-element array = 1589 Match! Avg = 7.751219512195122 Approximate low value of avg = 7.679480099505446 Approximate high value of avg = 7.779480099505446 Fits in! Difference between the unsuccessful and successful = 0.9620038259206121 *** 205-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(205) = 1393 >>> Theoretic accumulative number of comps in successful searches in an 205-element array = 1393 Match! Avg = 6.795121951219512 Approximate low value of avg = 6.6865005271832185 Approximate high value of avg = 6.786500527183218 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(205) = 1598 >>> Theoretic accumulative number of comps in unsuccessful searches in an 205-element array = 1598 Match! Avg = 7.757281553398058 Approximate low value of avg = 7.6865005271832185 Approximate high value of avg = 7.786500527183218 Fits in! Difference between the unsuccessful and successful = 0.9621596021785459 *** 206-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(206) = 1401 >>> Theoretic accumulative number of comps in successful searches in an 206-element array = 1401 Match! Avg = 6.800970873786408 Approximate low value of avg = 6.693486957499325 Approximate high value of avg = 6.793486957499325 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(206) = 1607 >>> Theoretic accumulative number of comps in unsuccessful searches in an 206-element array = 1607 Match! Avg = 7.763285024154589 Approximate low value of avg = 7.693486957499325 Approximate high value of avg = 7.793486957499325 Fits in! Difference between the unsuccessful and successful = 0.9623141503681811 *** 207-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(207) = 1409 >>> Theoretic accumulative number of comps in successful searches in an 207-element array = 1409 Match! Avg = 6.806763285024155 Approximate low value of avg = 6.700439718141093 Approximate high value of avg = 6.800439718141092 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(207) = 1616 >>> Theoretic accumulative number of comps in unsuccessful searches in an 207-element array = 1616 Match! Avg = 7.769230769230769 Approximate low value of avg = 7.700439718141093 Approximate high value of avg = 7.800439718141092 Fits in! Difference between the unsuccessful and successful = 0.9624674842066145 *** 208-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(208) = 1417 >>> Theoretic accumulative number of comps in successful searches in an 208-element array = 1417 Match! Avg = 6.8125 Approximate low value of avg = 6.7073591320808825 Approximate high value of avg = 6.807359132080882 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(208) = 1625 >>> Theoretic accumulative number of comps in unsuccessful searches in an 208-element array = 1625 Match! Avg = 7.77511961722488 Approximate low value of avg = 7.7073591320808825 Approximate high value of avg = 7.807359132080882 Fits in! Difference between the unsuccessful and successful = 0.9626196172248802 *** 209-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(209) = 1425 >>> Theoretic accumulative number of comps in successful searches in an 209-element array = 1425 Match! Avg = 6.818181818181818 Approximate low value of avg = 6.714245517666122 Approximate high value of avg = 6.814245517666122 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(209) = 1634 >>> Theoretic accumulative number of comps in unsuccessful searches in an 209-element array = 1634 Match! Avg = 7.780952380952381 Approximate low value of avg = 7.714245517666122 Approximate high value of avg = 7.814245517666122 Fits in! Difference between the unsuccessful and successful = 0.9627705627705625 *** 210-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(210) = 1433 >>> Theoretic accumulative number of comps in successful searches in an 210-element array = 1433 Match! Avg = 6.8238095238095235 Approximate low value of avg = 6.721099188707186 Approximate high value of avg = 6.821099188707185 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(210) = 1643 >>> Theoretic accumulative number of comps in unsuccessful searches in an 210-element array = 1643 Match! Avg = 7.786729857819905 Approximate low value of avg = 7.721099188707186 Approximate high value of avg = 7.821099188707185 Fits in! Difference between the unsuccessful and successful = 0.9629203340103816 *** 211-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(211) = 1441 >>> Theoretic accumulative number of comps in successful searches in an 211-element array = 1441 Match! Avg = 6.829383886255924 Approximate low value of avg = 6.7279204545632 Approximate high value of avg = 6.827920454563199 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(211) = 1652 >>> Theoretic accumulative number of comps in unsuccessful searches in an 211-element array = 1652 Match! Avg = 7.7924528301886795 Approximate low value of avg = 7.7279204545632 Approximate high value of avg = 7.827920454563199 Fits in! Difference between the unsuccessful and successful = 0.9630689439327558 *** 212-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(212) = 1449 >>> Theoretic accumulative number of comps in successful searches in an 212-element array = 1449 Match! Avg = 6.834905660377358 Approximate low value of avg = 6.734709620225839 Approximate high value of avg = 6.834709620225839 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(212) = 1661 >>> Theoretic accumulative number of comps in unsuccessful searches in an 212-element array = 1661 Match! Avg = 7.7981220657277 Approximate low value of avg = 7.734709620225839 Approximate high value of avg = 7.834709620225839 Fits in! Difference between the unsuccessful and successful = 0.9632164053503418 *** 213-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(213) = 1457 >>> Theoretic accumulative number of comps in successful searches in an 213-element array = 1457 Match! Avg = 6.84037558685446 Approximate low value of avg = 6.7414669864011465 Approximate high value of avg = 6.841466986401146 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(213) = 1670 >>> Theoretic accumulative number of comps in unsuccessful searches in an 213-element array = 1670 Match! Avg = 7.803738317757009 Approximate low value of avg = 7.7414669864011465 Approximate high value of avg = 7.841466986401146 Fits in! Difference between the unsuccessful and successful = 0.9633627309025492 *** 214-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(214) = 1465 >>> Theoretic accumulative number of comps in successful searches in an 214-element array = 1465 Match! Avg = 6.845794392523365 Approximate low value of avg = 6.74819284958946 Approximate high value of avg = 6.848192849589459 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(214) = 1679 >>> Theoretic accumulative number of comps in unsuccessful searches in an 214-element array = 1679 Match! Avg = 7.809302325581395 Approximate low value of avg = 7.74819284958946 Approximate high value of avg = 7.848192849589459 Fits in! Difference between the unsuccessful and successful = 0.9635079330580307 *** 215-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(215) = 1473 >>> Theoretic accumulative number of comps in successful searches in an 215-element array = 1473 Match! Avg = 6.851162790697674 Approximate low value of avg = 6.754887502163469 Approximate high value of avg = 6.854887502163469 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(215) = 1688 >>> Theoretic accumulative number of comps in unsuccessful searches in an 215-element array = 1688 Match! Avg = 7.814814814814815 Approximate low value of avg = 7.754887502163469 Approximate high value of avg = 7.854887502163469 Fits in! Difference between the unsuccessful and successful = 0.9636520241171409 *** 216-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(216) = 1481 >>> Theoretic accumulative number of comps in successful searches in an 216-element array = 1481 Match! Avg = 6.856481481481482 Approximate low value of avg = 6.7615512324444795 Approximate high value of avg = 6.861551232444479 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(216) = 1697 >>> Theoretic accumulative number of comps in unsuccessful searches in an 216-element array = 1697 Match! Avg = 7.820276497695852 Approximate low value of avg = 7.7615512324444795 Approximate high value of avg = 7.861551232444479 Fits in! Difference between the unsuccessful and successful = 0.9637950162143705 *** 217-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(217) = 1489 >>> Theoretic accumulative number of comps in successful searches in an 217-element array = 1489 Match! Avg = 6.861751152073733 Approximate low value of avg = 6.768184324776926 Approximate high value of avg = 6.868184324776926 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(217) = 1706 >>> Theoretic accumulative number of comps in unsuccessful searches in an 217-element array = 1706 Match! Avg = 7.825688073394495 Approximate low value of avg = 7.768184324776926 Approximate high value of avg = 7.868184324776926 Fits in! Difference between the unsuccessful and successful = 0.9639369213207623 *** 218-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(218) = 1497 >>> Theoretic accumulative number of comps in successful searches in an 218-element array = 1497 Match! Avg = 6.86697247706422 Approximate low value of avg = 6.774787059601174 Approximate high value of avg = 6.874787059601173 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(218) = 1715 >>> Theoretic accumulative number of comps in unsuccessful searches in an 218-element array = 1715 Match! Avg = 7.831050228310502 Approximate low value of avg = 7.774787059601174 Approximate high value of avg = 7.874787059601173 Fits in! Difference between the unsuccessful and successful = 0.9640777512462826 *** 219-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(219) = 1505 >>> Theoretic accumulative number of comps in successful searches in an 219-element array = 1505 Match! Avg = 6.872146118721461 Approximate low value of avg = 6.781359713524661 Approximate high value of avg = 6.8813597135246605 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(219) = 1724 >>> Theoretic accumulative number of comps in unsuccessful searches in an 219-element array = 1724 Match! Avg = 7.836363636363636 Approximate low value of avg = 7.781359713524661 Approximate high value of avg = 7.8813597135246605 Fits in! Difference between the unsuccessful and successful = 0.964217517642175 *** 220-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(220) = 1513 >>> Theoretic accumulative number of comps in successful searches in an 220-element array = 1513 Match! Avg = 6.877272727272727 Approximate low value of avg = 6.787902559391432 Approximate high value of avg = 6.887902559391431 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(220) = 1733 >>> Theoretic accumulative number of comps in unsuccessful searches in an 220-element array = 1733 Match! Avg = 7.841628959276018 Approximate low value of avg = 7.787902559391432 Approximate high value of avg = 7.887902559391431 Fits in! Difference between the unsuccessful and successful = 0.9643562320032908 *** 221-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(221) = 1521 >>> Theoretic accumulative number of comps in successful searches in an 221-element array = 1521 Match! Avg = 6.882352941176471 Approximate low value of avg = 6.794415866350106 Approximate high value of avg = 6.894415866350106 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(221) = 1742 >>> Theoretic accumulative number of comps in unsuccessful searches in an 221-element array = 1742 Match! Avg = 7.846846846846847 Approximate low value of avg = 7.794415866350106 Approximate high value of avg = 7.894415866350106 Fits in! Difference between the unsuccessful and successful = 0.9644939056703761 *** 222-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(222) = 1529 >>> Theoretic accumulative number of comps in successful searches in an 222-element array = 1529 Match! Avg = 6.887387387387387 Approximate low value of avg = 6.800899899920305 Approximate high value of avg = 6.900899899920304 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(222) = 1751 >>> Theoretic accumulative number of comps in unsuccessful searches in an 222-element array = 1751 Match! Avg = 7.852017937219731 Approximate low value of avg = 7.800899899920305 Approximate high value of avg = 7.900899899920304 Fits in! Difference between the unsuccessful and successful = 0.9646305498323438 *** 223-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(223) = 1537 >>> Theoretic accumulative number of comps in successful searches in an 223-element array = 1537 Match! Avg = 6.8923766816143495 Approximate low value of avg = 6.807354922057604 Approximate high value of avg = 6.907354922057603 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(223) = 1760 >>> Theoretic accumulative number of comps in unsuccessful searches in an 223-element array = 1760 Match! Avg = 7.857142857142857 Approximate low value of avg = 7.807354922057604 Approximate high value of avg = 7.907354922057603 Fits in! Difference between the unsuccessful and successful = 0.9647661755285073 *** 224-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(224) = 1545 >>> Theoretic accumulative number of comps in successful searches in an 224-element array = 1545 Match! Avg = 6.897321428571429 Approximate low value of avg = 6.813781191217037 Approximate high value of avg = 6.913781191217037 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(224) = 1769 >>> Theoretic accumulative number of comps in unsuccessful searches in an 224-element array = 1769 Match! Avg = 7.862222222222222 Approximate low value of avg = 7.813781191217037 Approximate high value of avg = 7.913781191217037 Fits in! Difference between the unsuccessful and successful = 0.9649007936507932 *** 225-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(225) = 1553 >>> Theoretic accumulative number of comps in successful searches in an 225-element array = 1553 Match! Avg = 6.902222222222222 Approximate low value of avg = 6.820178962415189 Approximate high value of avg = 6.920178962415188 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(225) = 1778 >>> Theoretic accumulative number of comps in unsuccessful searches in an 225-element array = 1778 Match! Avg = 7.867256637168142 Approximate low value of avg = 7.820178962415189 Approximate high value of avg = 7.920178962415188 Fits in! Difference between the unsuccessful and successful = 0.9650344149459196 *** 226-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(226) = 1561 >>> Theoretic accumulative number of comps in successful searches in an 226-element array = 1561 Match! Avg = 6.907079646017699 Approximate low value of avg = 6.826548487290916 Approximate high value of avg = 6.9265484872909155 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(226) = 1787 >>> Theoretic accumulative number of comps in unsuccessful searches in an 226-element array = 1787 Match! Avg = 7.872246696035242 Approximate low value of avg = 7.826548487290916 Approximate high value of avg = 7.9265484872909155 Fits in! Difference between the unsuccessful and successful = 0.9651670500175431 *** 227-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(227) = 1569 >>> Theoretic accumulative number of comps in successful searches in an 227-element array = 1569 Match! Avg = 6.9118942731277535 Approximate low value of avg = 6.832890014164742 Approximate high value of avg = 6.932890014164742 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(227) = 1796 >>> Theoretic accumulative number of comps in unsuccessful searches in an 227-element array = 1796 Match! Avg = 7.87719298245614 Approximate low value of avg = 7.832890014164742 Approximate high value of avg = 7.932890014164742 Fits in! Difference between the unsuccessful and successful = 0.9652987093283869 *** 228-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(228) = 1577 >>> Theoretic accumulative number of comps in successful searches in an 228-element array = 1577 Match! Avg = 6.916666666666667 Approximate low value of avg = 6.8392037880969445 Approximate high value of avg = 6.939203788096944 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(228) = 1805 >>> Theoretic accumulative number of comps in unsuccessful searches in an 228-element array = 1805 Match! Avg = 7.882096069868996 Approximate low value of avg = 7.8392037880969445 Approximate high value of avg = 7.939203788096944 Fits in! Difference between the unsuccessful and successful = 0.9654294032023287 *** 229-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(229) = 1585 >>> Theoretic accumulative number of comps in successful searches in an 229-element array = 1585 Match! Avg = 6.921397379912664 Approximate low value of avg = 6.845490050944376 Approximate high value of avg = 6.945490050944375 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(229) = 1814 >>> Theoretic accumulative number of comps in unsuccessful searches in an 229-element array = 1814 Match! Avg = 7.886956521739131 Approximate low value of avg = 7.845490050944376 Approximate high value of avg = 7.945490050944375 Fits in! Difference between the unsuccessful and successful = 0.9655591418264668 *** 230-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(230) = 1593 >>> Theoretic accumulative number of comps in successful searches in an 230-element array = 1593 Match! Avg = 6.926086956521739 Approximate low value of avg = 6.851749041416057 Approximate high value of avg = 6.951749041416057 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(230) = 1823 >>> Theoretic accumulative number of comps in unsuccessful searches in an 230-element array = 1823 Match! Avg = 7.891774891774892 Approximate low value of avg = 7.851749041416057 Approximate high value of avg = 7.951749041416057 Fits in! Difference between the unsuccessful and successful = 0.9656879352531531 *** 231-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(231) = 1601 >>> Theoretic accumulative number of comps in successful searches in an 231-element array = 1601 Match! Avg = 6.93073593073593 Approximate low value of avg = 6.857980995127572 Approximate high value of avg = 6.9579809951275715 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(231) = 1832 >>> Theoretic accumulative number of comps in unsuccessful searches in an 231-element array = 1832 Match! Avg = 7.896551724137931 Approximate low value of avg = 7.857980995127572 Approximate high value of avg = 7.9579809951275715 Fits in! Difference between the unsuccessful and successful = 0.9658157934020002 *** 232-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(232) = 1609 >>> Theoretic accumulative number of comps in successful searches in an 232-element array = 1609 Match! Avg = 6.935344827586207 Approximate low value of avg = 6.86418614465428 Approximate high value of avg = 6.964186144654279 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(232) = 1841 >>> Theoretic accumulative number of comps in unsuccessful searches in an 232-element array = 1841 Match! Avg = 7.901287553648069 Approximate low value of avg = 7.86418614465428 Approximate high value of avg = 7.964186144654279 Fits in! Difference between the unsuccessful and successful = 0.9659427260618614 *** 233-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(233) = 1617 >>> Theoretic accumulative number of comps in successful searches in an 233-element array = 1617 Match! Avg = 6.939914163090129 Approximate low value of avg = 6.870364719583405 Approximate high value of avg = 6.970364719583404 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(233) = 1850 >>> Theoretic accumulative number of comps in unsuccessful searches in an 233-element array = 1850 Match! Avg = 7.905982905982906 Approximate low value of avg = 7.870364719583405 Approximate high value of avg = 7.970364719583404 Fits in! Difference between the unsuccessful and successful = 0.9660687428927774 *** 234-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(234) = 1625 >>> Theoretic accumulative number of comps in successful searches in an 234-element array = 1625 Match! Avg = 6.944444444444445 Approximate low value of avg = 6.876516946565 Approximate high value of avg = 6.976516946565 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(234) = 1859 >>> Theoretic accumulative number of comps in unsuccessful searches in an 234-element array = 1859 Match! Avg = 7.910638297872341 Approximate low value of avg = 7.876516946565 Approximate high value of avg = 7.976516946565 Fits in! Difference between the unsuccessful and successful = 0.966193853427896 *** 235-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(235) = 1633 >>> Theoretic accumulative number of comps in successful searches in an 235-element array = 1633 Match! Avg = 6.948936170212766 Approximate low value of avg = 6.8826430493618425 Approximate high value of avg = 6.982643049361842 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(235) = 1868 >>> Theoretic accumulative number of comps in unsuccessful searches in an 235-element array = 1868 Match! Avg = 7.915254237288136 Approximate low value of avg = 7.8826430493618425 Approximate high value of avg = 7.982643049361842 Fits in! Difference between the unsuccessful and successful = 0.9663180670753695 *** 236-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(236) = 1641 >>> Theoretic accumulative number of comps in successful searches in an 236-element array = 1641 Match! Avg = 6.953389830508475 Approximate low value of avg = 6.88874324889826 Approximate high value of avg = 6.98874324889826 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(236) = 1877 >>> Theoretic accumulative number of comps in unsuccessful searches in an 236-element array = 1877 Match! Avg = 7.919831223628692 Approximate low value of avg = 7.88874324889826 Approximate high value of avg = 7.98874324889826 Fits in! Difference between the unsuccessful and successful = 0.9664413931202169 *** 237-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(237) = 1649 >>> Theoretic accumulative number of comps in successful searches in an 237-element array = 1649 Match! Avg = 6.957805907172996 Approximate low value of avg = 6.894817763307945 Approximate high value of avg = 6.994817763307944 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(237) = 1886 >>> Theoretic accumulative number of comps in unsuccessful searches in an 237-element array = 1886 Match! Avg = 7.92436974789916 Approximate low value of avg = 7.894817763307945 Approximate high value of avg = 7.994817763307944 Fits in! Difference between the unsuccessful and successful = 0.9665638407261641 *** 238-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(238) = 1657 >>> Theoretic accumulative number of comps in successful searches in an 238-element array = 1657 Match! Avg = 6.96218487394958 Approximate low value of avg = 6.90086680798075 Approximate high value of avg = 7.000866807980749 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(238) = 1895 >>> Theoretic accumulative number of comps in unsuccessful searches in an 238-element array = 1895 Match! Avg = 7.928870292887029 Approximate low value of avg = 7.90086680798075 Approximate high value of avg = 8.00086680798075 Fits in! Difference between the unsuccessful and successful = 0.9666854189374492 *** 239-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(239) = 1665 >>> Theoretic accumulative number of comps in successful searches in an 239-element array = 1665 Match! Avg = 6.96652719665272 Approximate low value of avg = 6.906890595608519 Approximate high value of avg = 7.006890595608518 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(239) = 1904 >>> Theoretic accumulative number of comps in unsuccessful searches in an 239-element array = 1904 Match! Avg = 7.933333333333334 Approximate low value of avg = 7.906890595608519 Approximate high value of avg = 8.00689059560852 Fits in! Difference between the unsuccessful and successful = 0.9668061366806135 *** 240-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(240) = 1673 >>> Theoretic accumulative number of comps in successful searches in an 240-element array = 1673 Match! Avg = 6.970833333333333 Approximate low value of avg = 6.912889336229962 Approximate high value of avg = 7.012889336229962 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(240) = 1913 >>> Theoretic accumulative number of comps in unsuccessful searches in an 240-element array = 1913 Match! Avg = 7.937759336099585 Approximate low value of avg = 7.912889336229962 Approximate high value of avg = 8.012889336229962 Fits in! Difference between the unsuccessful and successful = 0.9669260027662521 *** 241-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(241) = 1681 >>> Theoretic accumulative number of comps in successful searches in an 241-element array = 1681 Match! Avg = 6.975103734439834 Approximate low value of avg = 6.9188632372745955 Approximate high value of avg = 7.018863237274595 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(241) = 1922 >>> Theoretic accumulative number of comps in unsuccessful searches in an 241-element array = 1922 Match! Avg = 7.9421487603305785 Approximate low value of avg = 7.9188632372745955 Approximate high value of avg = 8.018863237274596 Fits in! Difference between the unsuccessful and successful = 0.9670450258907444 *** 242-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(242) = 1689 >>> Theoretic accumulative number of comps in successful searches in an 242-element array = 1689 Match! Avg = 6.979338842975206 Approximate low value of avg = 6.924812503605781 Approximate high value of avg = 7.024812503605781 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(242) = 1931 >>> Theoretic accumulative number of comps in unsuccessful searches in an 242-element array = 1931 Match! Avg = 7.946502057613169 Approximate low value of avg = 7.924812503605781 Approximate high value of avg = 8.024812503605782 Fits in! Difference between the unsuccessful and successful = 0.9671632146379627 *** 243-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(243) = 1697 >>> Theoretic accumulative number of comps in successful searches in an 243-element array = 1697 Match! Avg = 6.983539094650205 Approximate low value of avg = 6.930737337562887 Approximate high value of avg = 7.030737337562886 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(243) = 1940 >>> Theoretic accumulative number of comps in unsuccessful searches in an 243-element array = 1940 Match! Avg = 7.950819672131147 Approximate low value of avg = 7.930737337562887 Approximate high value of avg = 8.030737337562886 Fits in! Difference between the unsuccessful and successful = 0.9672805774809419 *** 244-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(244) = 1705 >>> Theoretic accumulative number of comps in successful searches in an 244-element array = 1705 Match! Avg = 6.987704918032787 Approximate low value of avg = 6.936637939002572 Approximate high value of avg = 7.0366379390025715 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(244) = 1949 >>> Theoretic accumulative number of comps in unsuccessful searches in an 244-element array = 1949 Match! Avg = 7.955102040816326 Approximate low value of avg = 7.936637939002572 Approximate high value of avg = 8.036637939002572 Fits in! Difference between the unsuccessful and successful = 0.9673971227835398 *** 245-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(245) = 1713 >>> Theoretic accumulative number of comps in successful searches in an 245-element array = 1713 Match! Avg = 6.9918367346938775 Approximate low value of avg = 6.94251450533924 Approximate high value of avg = 7.0425145053392395 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(245) = 1958 >>> Theoretic accumulative number of comps in unsuccessful searches in an 245-element array = 1958 Match! Avg = 7.959349593495935 Approximate low value of avg = 7.94251450533924 Approximate high value of avg = 8.04251450533924 Fits in! Difference between the unsuccessful and successful = 0.9675128588020572 *** 246-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(246) = 1721 >>> Theoretic accumulative number of comps in successful searches in an 246-element array = 1721 Match! Avg = 6.995934959349594 Approximate low value of avg = 6.948367231584678 Approximate high value of avg = 7.0483672315846775 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(246) = 1967 >>> Theoretic accumulative number of comps in unsuccessful searches in an 246-element array = 1967 Match! Avg = 7.963562753036437 Approximate low value of avg = 7.948367231584678 Approximate high value of avg = 8.048367231584677 Fits in! Difference between the unsuccessful and successful = 0.9676277936868436 *** 247-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(247) = 1729 >>> Theoretic accumulative number of comps in successful searches in an 247-element array = 1729 Match! Avg = 7.0 Approximate low value of avg = 6.954196310386876 Approximate high value of avg = 7.0541963103868754 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(247) = 1976 >>> Theoretic accumulative number of comps in unsuccessful searches in an 247-element array = 1976 Match! Avg = 7.967741935483871 Approximate low value of avg = 7.954196310386876 Approximate high value of avg = 8.054196310386876 Fits in! Difference between the unsuccessful and successful = 0.967741935483871 *** 248-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(248) = 1737 >>> Theoretic accumulative number of comps in successful searches in an 248-element array = 1737 Match! Avg = 7.004032258064516 Approximate low value of avg = 6.960001932068081 Approximate high value of avg = 7.06000193206808 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(248) = 1985 >>> Theoretic accumulative number of comps in unsuccessful searches in an 248-element array = 1985 Match! Avg = 7.971887550200803 Approximate low value of avg = 7.960001932068081 Approximate high value of avg = 8.060001932068081 Fits in! Difference between the unsuccessful and successful = 0.9678552921362868 *** 249-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(249) = 1745 >>> Theoretic accumulative number of comps in successful searches in an 249-element array = 1745 Match! Avg = 7.008032128514056 Approximate low value of avg = 6.965784284662087 Approximate high value of avg = 7.065784284662087 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(249) = 1994 >>> Theoretic accumulative number of comps in unsuccessful searches in an 249-element array = 1994 Match! Avg = 7.976 Approximate low value of avg = 7.965784284662087 Approximate high value of avg = 8.065784284662087 Fits in! Difference between the unsuccessful and successful = 0.9679678714859437 *** 250-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(250) = 1753 >>> Theoretic accumulative number of comps in successful searches in an 250-element array = 1753 Match! Avg = 7.012 Approximate low value of avg = 6.971543553950772 Approximate high value of avg = 7.071543553950772 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(250) = 2003 >>> Theoretic accumulative number of comps in unsuccessful searches in an 250-element array = 2003 Match! Avg = 7.9800796812749 Approximate low value of avg = 7.971543553950772 Approximate high value of avg = 8.071543553950772 Fits in! Difference between the unsuccessful and successful = 0.9680796812749008 *** 251-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(251) = 1761 >>> Theoretic accumulative number of comps in successful searches in an 251-element array = 1761 Match! Avg = 7.01593625498008 Approximate low value of avg = 6.977279923499917 Approximate high value of avg = 7.077279923499916 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(251) = 2012 >>> Theoretic accumulative number of comps in unsuccessful searches in an 251-element array = 2012 Match! Avg = 7.984126984126984 Approximate low value of avg = 7.977279923499917 Approximate high value of avg = 8.077279923499917 Fits in! Difference between the unsuccessful and successful = 0.9681907291469045 *** 252-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(252) = 1769 >>> Theoretic accumulative number of comps in successful searches in an 252-element array = 1769 Match! Avg = 7.01984126984127 Approximate low value of avg = 6.98299357469431 Approximate high value of avg = 7.08299357469431 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(252) = 2021 >>> Theoretic accumulative number of comps in unsuccessful searches in an 252-element array = 2021 Match! Avg = 7.988142292490118 Approximate low value of avg = 7.98299357469431 Approximate high value of avg = 8.08299357469431 Fits in! Difference between the unsuccessful and successful = 0.9683010226488484 *** 253-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(253) = 1777 >>> Theoretic accumulative number of comps in successful searches in an 253-element array = 1777 Match! Avg = 7.023715415019763 Approximate low value of avg = 6.988684686772166 Approximate high value of avg = 7.088684686772166 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(253) = 2030 >>> Theoretic accumulative number of comps in unsuccessful searches in an 253-element array = 2030 Match! Avg = 7.9921259842519685 Approximate low value of avg = 7.988684686772166 Approximate high value of avg = 8.088684686772167 Fits in! Difference between the unsuccessful and successful = 0.9684105692322058 *** 254-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(254) = 1785 >>> Theoretic accumulative number of comps in successful searches in an 254-element array = 1785 Match! Avg = 7.02755905511811 Approximate low value of avg = 6.994353436858858 Approximate high value of avg = 7.094353436858857 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(254) = 2039 >>> Theoretic accumulative number of comps in unsuccessful searches in an 254-element array = 2039 Match! Avg = 7.996078431372549 Approximate low value of avg = 7.994353436858858 Approximate high value of avg = 8.094353436858858 Fits in! Difference between the unsuccessful and successful = 0.9685193762544388 *** 255-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(255) = 1793 >>> Theoretic accumulative number of comps in successful searches in an 255-element array = 1793 Match! Avg = 7.031372549019608 Approximate low value of avg = 7.0 Approximate high value of avg = 7.1 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(255) = 2048 >>> Theoretic accumulative number of comps in unsuccessful searches in an 255-element array = 2048 Match! Avg = 8.0 Approximate low value of avg = 8.0 Approximate high value of avg = 8.1 Fits in! Difference between the unsuccessful and successful = 0.9686274509803923 *** 256-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(256) = 1802 >>> Theoretic accumulative number of comps in successful searches in an 256-element array = 1802 Match! Avg = 7.0390625 Approximate low value of avg = 7.005624549193879 Approximate high value of avg = 7.1056245491938785 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(256) = 2058 >>> Theoretic accumulative number of comps in unsuccessful searches in an 256-element array = 2058 Match! Avg = 8.007782101167315 Approximate low value of avg = 8.005624549193879 Approximate high value of avg = 8.105624549193879 Fits in! Difference between the unsuccessful and successful = 0.9687196011673151 *** 257-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(257) = 1811 >>> Theoretic accumulative number of comps in successful searches in an 257-element array = 1811 Match! Avg = 7.046692607003891 Approximate low value of avg = 7.011227255423254 Approximate high value of avg = 7.111227255423254 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(257) = 2068 >>> Theoretic accumulative number of comps in unsuccessful searches in an 257-element array = 2068 Match! Avg = 8.015503875968992 Approximate low value of avg = 8.011227255423254 Approximate high value of avg = 8.111227255423254 Fits in! Difference between the unsuccessful and successful = 0.9688112689651014 *** 258-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(258) = 1820 >>> Theoretic accumulative number of comps in successful searches in an 258-element array = 1820 Match! Avg = 7.054263565891473 Approximate low value of avg = 7.016808287686553 Approximate high value of avg = 7.116808287686553 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(258) = 2078 >>> Theoretic accumulative number of comps in unsuccessful searches in an 258-element array = 2078 Match! Avg = 8.023166023166024 Approximate low value of avg = 8.016808287686553 Approximate high value of avg = 8.116808287686553 Fits in! Difference between the unsuccessful and successful = 0.9689024572745506 *** 259-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(259) = 1829 >>> Theoretic accumulative number of comps in successful searches in an 259-element array = 1829 Match! Avg = 7.061776061776062 Approximate low value of avg = 7.022367813028454 Approximate high value of avg = 7.122367813028454 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(259) = 2088 >>> Theoretic accumulative number of comps in unsuccessful searches in an 259-element array = 2088 Match! Avg = 8.03076923076923 Approximate low value of avg = 8.022367813028454 Approximate high value of avg = 8.122367813028454 Fits in! Difference between the unsuccessful and successful = 0.968993168993169 *** 260-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(260) = 1838 >>> Theoretic accumulative number of comps in successful searches in an 260-element array = 1838 Match! Avg = 7.069230769230769 Approximate low value of avg = 7.027905996569885 Approximate high value of avg = 7.1279059965698846 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(260) = 2098 >>> Theoretic accumulative number of comps in unsuccessful searches in an 260-element array = 2098 Match! Avg = 8.03831417624521 Approximate low value of avg = 8.027905996569885 Approximate high value of avg = 8.127905996569885 Fits in! Difference between the unsuccessful and successful = 0.9690834070144412 *** 261-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(261) = 1847 >>> Theoretic accumulative number of comps in successful searches in an 261-element array = 1847 Match! Avg = 7.076628352490421 Approximate low value of avg = 7.03342300153745 Approximate high value of avg = 7.13342300153745 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(261) = 2108 >>> Theoretic accumulative number of comps in unsuccessful searches in an 261-element array = 2108 Match! Avg = 8.045801526717558 Approximate low value of avg = 8.03342300153745 Approximate high value of avg = 8.13342300153745 Fits in! Difference between the unsuccessful and successful = 0.9691731742271363 *** 262-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(262) = 1856 >>> Theoretic accumulative number of comps in successful searches in an 262-element array = 1856 Match! Avg = 7.083969465648855 Approximate low value of avg = 7.038918989292302 Approximate high value of avg = 7.138918989292302 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(262) = 2118 >>> Theoretic accumulative number of comps in unsuccessful searches in an 262-element array = 2118 Match! Avg = 8.053231939163497 Approximate low value of avg = 8.038918989292302 Approximate high value of avg = 8.138918989292302 Fits in! Difference between the unsuccessful and successful = 0.9692624735146422 *** 263-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(263) = 1865 >>> Theoretic accumulative number of comps in successful searches in an 263-element array = 1865 Match! Avg = 7.091254752851711 Approximate low value of avg = 7.044394119358454 Approximate high value of avg = 7.144394119358454 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(263) = 2128 >>> Theoretic accumulative number of comps in unsuccessful searches in an 263-element array = 2128 Match! Avg = 8.06060606060606 Approximate low value of avg = 8.044394119358454 Approximate high value of avg = 8.144394119358454 Fits in! Difference between the unsuccessful and successful = 0.9693513077543496 *** 264-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(264) = 1874 >>> Theoretic accumulative number of comps in successful searches in an 264-element array = 1874 Match! Avg = 7.098484848484849 Approximate low value of avg = 7.049848549450562 Approximate high value of avg = 7.149848549450562 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(264) = 2138 >>> Theoretic accumulative number of comps in unsuccessful searches in an 264-element array = 2138 Match! Avg = 8.067924528301887 Approximate low value of avg = 8.049848549450562 Approximate high value of avg = 8.149848549450562 Fits in! Difference between the unsuccessful and successful = 0.9694396798170386 *** 265-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(265) = 1883 >>> Theoretic accumulative number of comps in successful searches in an 265-element array = 1883 Match! Avg = 7.1056603773584905 Approximate low value of avg = 7.055282435501191 Approximate high value of avg = 7.15528243550119 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(265) = 2148 >>> Theoretic accumulative number of comps in unsuccessful searches in an 265-element array = 2148 Match! Avg = 8.075187969924812 Approximate low value of avg = 8.05528243550119 Approximate high value of avg = 8.15528243550119 Fits in! Difference between the unsuccessful and successful = 0.9695275925663216 *** 266-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(266) = 1892 >>> Theoretic accumulative number of comps in successful searches in an 266-element array = 1892 Match! Avg = 7.112781954887218 Approximate low value of avg = 7.060695931687555 Approximate high value of avg = 7.160695931687554 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(266) = 2158 >>> Theoretic accumulative number of comps in unsuccessful searches in an 266-element array = 2158 Match! Avg = 8.082397003745319 Approximate low value of avg = 8.060695931687555 Approximate high value of avg = 8.160695931687554 Fits in! Difference between the unsuccessful and successful = 0.9696150488581008 *** 267-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(267) = 1901 >>> Theoretic accumulative number of comps in successful searches in an 267-element array = 1901 Match! Avg = 7.119850187265918 Approximate low value of avg = 7.066089190457772 Approximate high value of avg = 7.166089190457772 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(267) = 2168 >>> Theoretic accumulative number of comps in unsuccessful searches in an 267-element array = 2168 Match! Avg = 8.08955223880597 Approximate low value of avg = 8.066089190457772 Approximate high value of avg = 8.166089190457772 Fits in! Difference between the unsuccessful and successful = 0.9697020515400521 *** 268-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(268) = 1910 >>> Theoretic accumulative number of comps in successful searches in an 268-element array = 1910 Match! Avg = 7.126865671641791 Approximate low value of avg = 7.071462362556625 Approximate high value of avg = 7.171462362556625 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(268) = 2178 >>> Theoretic accumulative number of comps in unsuccessful searches in an 268-element array = 2178 Match! Avg = 8.096654275092936 Approximate low value of avg = 8.071462362556625 Approximate high value of avg = 8.171462362556625 Fits in! Difference between the unsuccessful and successful = 0.9697886034511454 *** 269-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(269) = 1919 >>> Theoretic accumulative number of comps in successful searches in an 269-element array = 1919 Match! Avg = 7.133828996282528 Approximate low value of avg = 7.076815597050832 Approximate high value of avg = 7.176815597050831 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(269) = 2188 >>> Theoretic accumulative number of comps in unsuccessful searches in an 269-element array = 2188 Match! Avg = 8.103703703703705 Approximate low value of avg = 8.076815597050832 Approximate high value of avg = 8.176815597050831 Fits in! Difference between the unsuccessful and successful = 0.9698747074211767 *** 270-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(270) = 1928 >>> Theoretic accumulative number of comps in successful searches in an 270-element array = 1928 Match! Avg = 7.140740740740741 Approximate low value of avg = 7.082149041353873 Approximate high value of avg = 7.182149041353872 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(270) = 2198 >>> Theoretic accumulative number of comps in unsuccessful searches in an 270-element array = 2198 Match! Avg = 8.11070110701107 Approximate low value of avg = 8.082149041353873 Approximate high value of avg = 8.182149041353872 Fits in! Difference between the unsuccessful and successful = 0.96996036627033 *** 271-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(271) = 1937 >>> Theoretic accumulative number of comps in successful searches in an 271-element array = 1937 Match! Avg = 7.14760147601476 Approximate low value of avg = 7.087462841250341 Approximate high value of avg = 7.1874628412503405 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(271) = 2208 >>> Theoretic accumulative number of comps in unsuccessful searches in an 271-element array = 2208 Match! Avg = 8.117647058823529 Approximate low value of avg = 8.08746284125034 Approximate high value of avg = 8.18746284125034 Fits in! Difference between the unsuccessful and successful = 0.9700455828087691 *** 272-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(272) = 1946 >>> Theoretic accumulative number of comps in successful searches in an 272-element array = 1946 Match! Avg = 7.154411764705882 Approximate low value of avg = 7.092757140919852 Approximate high value of avg = 7.192757140919852 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(272) = 2218 >>> Theoretic accumulative number of comps in unsuccessful searches in an 272-element array = 2218 Match! Avg = 8.124542124542124 Approximate low value of avg = 8.092757140919852 Approximate high value of avg = 8.192757140919852 Fits in! Difference between the unsuccessful and successful = 0.9701303598362419 *** 273-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(273) = 1955 >>> Theoretic accumulative number of comps in successful searches in an 273-element array = 1955 Match! Avg = 7.1611721611721615 Approximate low value of avg = 7.098032082960527 Approximate high value of avg = 7.198032082960527 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(273) = 2228 >>> Theoretic accumulative number of comps in unsuccessful searches in an 273-element array = 2228 Match! Avg = 8.13138686131387 Approximate low value of avg = 8.098032082960527 Approximate high value of avg = 8.198032082960527 Fits in! Difference between the unsuccessful and successful = 0.9702147001417076 *** 274-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(274) = 1964 >>> Theoretic accumulative number of comps in successful searches in an 274-element array = 1964 Match! Avg = 7.1678832116788325 Approximate low value of avg = 7.1032878084120235 Approximate high value of avg = 7.203287808412023 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(274) = 2238 >>> Theoretic accumulative number of comps in unsuccessful searches in an 274-element array = 2238 Match! Avg = 8.138181818181819 Approximate low value of avg = 8.103287808412023 Approximate high value of avg = 8.203287808412023 Fits in! Difference between the unsuccessful and successful = 0.9702986065029862 *** 275-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(275) = 1973 >>> Theoretic accumulative number of comps in successful searches in an 275-element array = 1973 Match! Avg = 7.174545454545455 Approximate low value of avg = 7.108524456778168 Approximate high value of avg = 7.208524456778168 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(275) = 2248 >>> Theoretic accumulative number of comps in unsuccessful searches in an 275-element array = 2248 Match! Avg = 8.144927536231885 Approximate low value of avg = 8.108524456778168 Approximate high value of avg = 8.208524456778168 Fits in! Difference between the unsuccessful and successful = 0.9703820816864299 *** 276-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(276) = 1982 >>> Theoretic accumulative number of comps in successful searches in an 276-element array = 1982 Match! Avg = 7.181159420289855 Approximate low value of avg = 7.113742166049189 Approximate high value of avg = 7.2137421660491885 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(276) = 2258 >>> Theoretic accumulative number of comps in unsuccessful searches in an 276-element array = 2258 Match! Avg = 8.151624548736462 Approximate low value of avg = 8.113742166049189 Approximate high value of avg = 8.213742166049188 Fits in! Difference between the unsuccessful and successful = 0.970465128446607 *** 277-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(277) = 1991 >>> Theoretic accumulative number of comps in successful searches in an 277-element array = 1991 Match! Avg = 7.187725631768953 Approximate low value of avg = 7.118941072723507 Approximate high value of avg = 7.218941072723506 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(277) = 2268 >>> Theoretic accumulative number of comps in unsuccessful searches in an 277-element array = 2268 Match! Avg = 8.158273381294965 Approximate low value of avg = 8.118941072723507 Approximate high value of avg = 8.218941072723506 Fits in! Difference between the unsuccessful and successful = 0.9705477495260117 *** 278-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(278) = 2000 >>> Theoretic accumulative number of comps in successful searches in an 278-element array = 2000 Match! Avg = 7.194244604316546 Approximate low value of avg = 7.124121311829187 Approximate high value of avg = 7.224121311829187 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(278) = 2278 >>> Theoretic accumulative number of comps in unsuccessful searches in an 278-element array = 2278 Match! Avg = 8.164874551971327 Approximate low value of avg = 8.124121311829187 Approximate high value of avg = 8.224121311829187 Fits in! Difference between the unsuccessful and successful = 0.9706299476547802 *** 279-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(279) = 2009 >>> Theoretic accumulative number of comps in successful searches in an 279-element array = 2009 Match! Avg = 7.200716845878136 Approximate low value of avg = 7.1292830169449655 Approximate high value of avg = 7.229283016944965 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(279) = 2288 >>> Theoretic accumulative number of comps in unsuccessful searches in an 279-element array = 2288 Match! Avg = 8.17142857142857 Approximate low value of avg = 8.129283016944965 Approximate high value of avg = 8.229283016944965 Fits in! Difference between the unsuccessful and successful = 0.9707117255504345 *** 280-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(280) = 2018 >>> Theoretic accumulative number of comps in successful searches in an 280-element array = 2018 Match! Avg = 7.207142857142857 Approximate low value of avg = 7.134426320220927 Approximate high value of avg = 7.234426320220926 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(280) = 2298 >>> Theoretic accumulative number of comps in unsuccessful searches in an 280-element array = 2298 Match! Avg = 8.177935943060499 Approximate low value of avg = 8.134426320220927 Approximate high value of avg = 8.234426320220926 Fits in! Difference between the unsuccessful and successful = 0.9707930859176415 *** 281-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(281) = 2027 >>> Theoretic accumulative number of comps in successful searches in an 281-element array = 2027 Match! Avg = 7.213523131672598 Approximate low value of avg = 7.139551352398794 Approximate high value of avg = 7.239551352398793 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(281) = 2308 >>> Theoretic accumulative number of comps in unsuccessful searches in an 281-element array = 2308 Match! Avg = 8.184397163120567 Approximate low value of avg = 8.139551352398794 Approximate high value of avg = 8.239551352398793 Fits in! Difference between the unsuccessful and successful = 0.9708740314479689 *** 282-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(282) = 2036 >>> Theoretic accumulative number of comps in successful searches in an 282-element array = 2036 Match! Avg = 7.219858156028369 Approximate low value of avg = 7.144658242831882 Approximate high value of avg = 7.244658242831882 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(282) = 2318 >>> Theoretic accumulative number of comps in unsuccessful searches in an 282-element array = 2318 Match! Avg = 8.190812720848056 Approximate low value of avg = 8.144658242831882 Approximate high value of avg = 8.244658242831882 Fits in! Difference between the unsuccessful and successful = 0.9709545648196869 *** 283-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(283) = 2045 >>> Theoretic accumulative number of comps in successful searches in an 283-element array = 2045 Match! Avg = 7.226148409893993 Approximate low value of avg = 7.149747119504683 Approximate high value of avg = 7.249747119504683 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(283) = 2328 >>> Theoretic accumulative number of comps in unsuccessful searches in an 283-element array = 2328 Match! Avg = 8.19718309859155 Approximate low value of avg = 8.149747119504683 Approximate high value of avg = 8.249747119504683 Fits in! Difference between the unsuccessful and successful = 0.9710346886975572 *** 284-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(284) = 2054 >>> Theoretic accumulative number of comps in successful searches in an 284-element array = 2054 Match! Avg = 7.232394366197183 Approximate low value of avg = 7.154818109052105 Approximate high value of avg = 7.2548181090521044 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(284) = 2338 >>> Theoretic accumulative number of comps in unsuccessful searches in an 284-element array = 2338 Match! Avg = 8.203508771929824 Approximate low value of avg = 8.154818109052105 Approximate high value of avg = 8.254818109052104 Fits in! Difference between the unsuccessful and successful = 0.9711144057326413 *** 285-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(285) = 2063 >>> Theoretic accumulative number of comps in successful searches in an 285-element array = 2063 Match! Avg = 7.23859649122807 Approximate low value of avg = 7.159871336778389 Approximate high value of avg = 7.259871336778389 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(285) = 2348 >>> Theoretic accumulative number of comps in unsuccessful searches in an 285-element array = 2348 Match! Avg = 8.20979020979021 Approximate low value of avg = 8.159871336778389 Approximate high value of avg = 8.259871336778389 Fits in! Difference between the unsuccessful and successful = 0.97119371856214 *** 286-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(286) = 2072 >>> Theoretic accumulative number of comps in successful searches in an 286-element array = 2072 Match! Avg = 7.244755244755245 Approximate low value of avg = 7.164906926675689 Approximate high value of avg = 7.264906926675689 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(286) = 2358 >>> Theoretic accumulative number of comps in unsuccessful searches in an 286-element array = 2358 Match! Avg = 8.21602787456446 Approximate low value of avg = 8.16490692667569 Approximate high value of avg = 8.264906926675689 Fits in! Difference between the unsuccessful and successful = 0.9712726298092154 *** 287-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(287) = 2081 >>> Theoretic accumulative number of comps in successful searches in an 287-element array = 2081 Match! Avg = 7.2508710801393725 Approximate low value of avg = 7.169925001442312 Approximate high value of avg = 7.269925001442312 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(287) = 2368 >>> Theoretic accumulative number of comps in unsuccessful searches in an 287-element array = 2368 Match! Avg = 8.222222222222221 Approximate low value of avg = 8.169925001442312 Approximate high value of avg = 8.269925001442312 Fits in! Difference between the unsuccessful and successful = 0.9713511420828489 *** 288-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(288) = 2090 >>> Theoretic accumulative number of comps in successful searches in an 288-element array = 2090 Match! Avg = 7.256944444444445 Approximate low value of avg = 7.17492568250068 Approximate high value of avg = 7.27492568250068 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(288) = 2378 >>> Theoretic accumulative number of comps in unsuccessful searches in an 288-element array = 2378 Match! Avg = 8.228373702422145 Approximate low value of avg = 8.17492568250068 Approximate high value of avg = 8.27492568250068 Fits in! Difference between the unsuccessful and successful = 0.9714292579777002 *** 289-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(289) = 2099 >>> Theoretic accumulative number of comps in successful searches in an 289-element array = 2099 Match! Avg = 7.262975778546712 Approximate low value of avg = 7.1799090900149345 Approximate high value of avg = 7.279909090014934 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(289) = 2388 >>> Theoretic accumulative number of comps in unsuccessful searches in an 289-element array = 2388 Match! Avg = 8.23448275862069 Approximate low value of avg = 8.179909090014934 Approximate high value of avg = 8.279909090014934 Fits in! Difference between the unsuccessful and successful = 0.9715069800739773 *** 290-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(290) = 2108 >>> Theoretic accumulative number of comps in successful searches in an 290-element array = 2108 Match! Avg = 7.268965517241379 Approximate low value of avg = 7.184875342908285 Approximate high value of avg = 7.284875342908284 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(290) = 2398 >>> Theoretic accumulative number of comps in unsuccessful searches in an 290-element array = 2398 Match! Avg = 8.240549828178693 Approximate low value of avg = 8.184875342908285 Approximate high value of avg = 8.284875342908284 Fits in! Difference between the unsuccessful and successful = 0.9715843109373141 *** 291-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(291) = 2117 >>> Theoretic accumulative number of comps in successful searches in an 291-element array = 2117 Match! Avg = 7.274914089347079 Approximate low value of avg = 7.189824558880018 Approximate high value of avg = 7.289824558880017 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(291) = 2408 >>> Theoretic accumulative number of comps in unsuccessful searches in an 291-element array = 2408 Match! Avg = 8.246575342465754 Approximate low value of avg = 8.189824558880018 Approximate high value of avg = 8.289824558880017 Fits in! Difference between the unsuccessful and successful = 0.9716612531186746 *** 292-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(292) = 2126 >>> Theoretic accumulative number of comps in successful searches in an 292-element array = 2126 Match! Avg = 7.280821917808219 Approximate low value of avg = 7.194756854422248 Approximate high value of avg = 7.294756854422248 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(292) = 2418 >>> Theoretic accumulative number of comps in unsuccessful searches in an 292-element array = 2418 Match! Avg = 8.252559726962458 Approximate low value of avg = 8.194756854422248 Approximate high value of avg = 8.294756854422248 Fits in! Difference between the unsuccessful and successful = 0.9717378091542388 *** 293-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(293) = 2135 >>> Theoretic accumulative number of comps in successful searches in an 293-element array = 2135 Match! Avg = 7.286689419795222 Approximate low value of avg = 7.1996723448363635 Approximate high value of avg = 7.299672344836363 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(293) = 2428 >>> Theoretic accumulative number of comps in unsuccessful searches in an 293-element array = 2428 Match! Avg = 8.258503401360544 Approximate low value of avg = 8.199672344836364 Approximate high value of avg = 8.299672344836363 Fits in! Difference between the unsuccessful and successful = 0.9718139815653224 *** 294-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(294) = 2144 >>> Theoretic accumulative number of comps in successful searches in an 294-element array = 2144 Match! Avg = 7.292517006802721 Approximate low value of avg = 7.204571144249204 Approximate high value of avg = 7.304571144249204 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(294) = 2438 >>> Theoretic accumulative number of comps in unsuccessful searches in an 294-element array = 2438 Match! Avg = 8.264406779661018 Approximate low value of avg = 8.204571144249204 Approximate high value of avg = 8.304571144249204 Fits in! Difference between the unsuccessful and successful = 0.9718897728582965 *** 295-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(295) = 2153 >>> Theoretic accumulative number of comps in successful searches in an 295-element array = 2153 Match! Avg = 7.2983050847457624 Approximate low value of avg = 7.209453365628949 Approximate high value of avg = 7.309453365628949 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(295) = 2448 >>> Theoretic accumulative number of comps in unsuccessful searches in an 295-element array = 2448 Match! Avg = 8.27027027027027 Approximate low value of avg = 8.20945336562895 Approximate high value of avg = 8.309453365628949 Fits in! Difference between the unsuccessful and successful = 0.9719651855245077 *** 296-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(296) = 2162 >>> Theoretic accumulative number of comps in successful searches in an 296-element array = 2162 Match! Avg = 7.304054054054054 Approximate low value of avg = 7.214319120800766 Approximate high value of avg = 7.314319120800766 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(296) = 2458 >>> Theoretic accumulative number of comps in unsuccessful searches in an 296-element array = 2458 Match! Avg = 8.276094276094277 Approximate low value of avg = 8.214319120800766 Approximate high value of avg = 8.314319120800766 Fits in! Difference between the unsuccessful and successful = 0.9720402220402224 *** 297-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(297) = 2171 >>> Theoretic accumulative number of comps in successful searches in an 297-element array = 2171 Match! Avg = 7.30976430976431 Approximate low value of avg = 7.219168520462162 Approximate high value of avg = 7.319168520462162 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(297) = 2468 >>> Theoretic accumulative number of comps in unsuccessful searches in an 297-element array = 2468 Match! Avg = 8.281879194630873 Approximate low value of avg = 8.219168520462162 Approximate high value of avg = 8.319168520462162 Fits in! Difference between the unsuccessful and successful = 0.9721148848665635 *** 298-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(298) = 2180 >>> Theoretic accumulative number of comps in successful searches in an 298-element array = 2180 Match! Avg = 7.315436241610739 Approximate low value of avg = 7.224001674198107 Approximate high value of avg = 7.324001674198106 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(298) = 2478 >>> Theoretic accumulative number of comps in unsuccessful searches in an 298-element array = 2478 Match! Avg = 8.2876254180602 Approximate low value of avg = 8.224001674198107 Approximate high value of avg = 8.324001674198106 Fits in! Difference between the unsuccessful and successful = 0.9721891764494615 *** 299-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(299) = 2189 >>> Theoretic accumulative number of comps in successful searches in an 299-element array = 2189 Match! Avg = 7.321070234113712 Approximate low value of avg = 7.228818690495881 Approximate high value of avg = 7.328818690495881 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(299) = 2488 >>> Theoretic accumulative number of comps in unsuccessful searches in an 299-element array = 2488 Match! Avg = 8.293333333333333 Approximate low value of avg = 8.228818690495881 Approximate high value of avg = 8.328818690495881 Fits in! Difference between the unsuccessful and successful = 0.9722630992196208 *** 300-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(300) = 2198 >>> Theoretic accumulative number of comps in successful searches in an 300-element array = 2198 Match! Avg = 7.326666666666667 Approximate low value of avg = 7.233619676759702 Approximate high value of avg = 7.333619676759701 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(300) = 2498 >>> Theoretic accumulative number of comps in unsuccessful searches in an 300-element array = 2498 Match! Avg = 8.299003322259136 Approximate low value of avg = 8.233619676759702 Approximate high value of avg = 8.333619676759701 Fits in! Difference between the unsuccessful and successful = 0.9723366555924686 *** 301-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(301) = 2207 >>> Theoretic accumulative number of comps in successful searches in an 301-element array = 2207 Match! Avg = 7.332225913621262 Approximate low value of avg = 7.2384047393250786 Approximate high value of avg = 7.338404739325078 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(301) = 2508 >>> Theoretic accumulative number of comps in unsuccessful searches in an 301-element array = 2508 Match! Avg = 8.304635761589404 Approximate low value of avg = 8.238404739325079 Approximate high value of avg = 8.338404739325078 Fits in! Difference between the unsuccessful and successful = 0.9724098479681418 *** 302-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(302) = 2216 >>> Theoretic accumulative number of comps in successful searches in an 302-element array = 2216 Match! Avg = 7.337748344370861 Approximate low value of avg = 7.24317398347295 Approximate high value of avg = 7.3431739834729495 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(302) = 2518 >>> Theoretic accumulative number of comps in unsuccessful searches in an 302-element array = 2518 Match! Avg = 8.310231023102311 Approximate low value of avg = 8.24317398347295 Approximate high value of avg = 8.34317398347295 Fits in! Difference between the unsuccessful and successful = 0.97248267873145 *** 303-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(303) = 2225 >>> Theoretic accumulative number of comps in successful searches in an 303-element array = 2225 Match! Avg = 7.343234323432343 Approximate low value of avg = 7.247927513443585 Approximate high value of avg = 7.347927513443585 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(303) = 2528 >>> Theoretic accumulative number of comps in unsuccessful searches in an 303-element array = 2528 Match! Avg = 8.31578947368421 Approximate low value of avg = 8.247927513443585 Approximate high value of avg = 8.347927513443585 Fits in! Difference between the unsuccessful and successful = 0.9725551502518677 *** 304-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(304) = 2234 >>> Theoretic accumulative number of comps in successful searches in an 304-element array = 2234 Match! Avg = 7.348684210526316 Approximate low value of avg = 7.252665432450248 Approximate high value of avg = 7.352665432450248 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(304) = 2538 >>> Theoretic accumulative number of comps in unsuccessful searches in an 304-element array = 2538 Match! Avg = 8.321311475409836 Approximate low value of avg = 8.252665432450248 Approximate high value of avg = 8.352665432450248 Fits in! Difference between the unsuccessful and successful = 0.9726272648835197 *** 305-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(305) = 2243 >>> Theoretic accumulative number of comps in successful searches in an 305-element array = 2243 Match! Avg = 7.354098360655738 Approximate low value of avg = 7.257387842692651 Approximate high value of avg = 7.357387842692651 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(305) = 2548 >>> Theoretic accumulative number of comps in unsuccessful searches in an 305-element array = 2548 Match! Avg = 8.326797385620916 Approximate low value of avg = 8.257387842692651 Approximate high value of avg = 8.357387842692651 Fits in! Difference between the unsuccessful and successful = 0.9726990249651779 *** 306-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(306) = 2252 >>> Theoretic accumulative number of comps in successful searches in an 306-element array = 2252 Match! Avg = 7.359477124183006 Approximate low value of avg = 7.262094845370179 Approximate high value of avg = 7.362094845370178 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(306) = 2558 >>> Theoretic accumulative number of comps in unsuccessful searches in an 306-element array = 2558 Match! Avg = 8.332247557003257 Approximate low value of avg = 8.262094845370179 Approximate high value of avg = 8.362094845370178 Fits in! Difference between the unsuccessful and successful = 0.9727704328202504 *** 307-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(307) = 2261 >>> Theoretic accumulative number of comps in successful searches in an 307-element array = 2261 Match! Avg = 7.364820846905538 Approximate low value of avg = 7.2667865406949 Approximate high value of avg = 7.3667865406949 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(307) = 2568 >>> Theoretic accumulative number of comps in unsuccessful searches in an 307-element array = 2568 Match! Avg = 8.337662337662337 Approximate low value of avg = 8.2667865406949 Approximate high value of avg = 8.3667865406949 Fits in! Difference between the unsuccessful and successful = 0.9728414907567995 *** 308-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(308) = 2270 >>> Theoretic accumulative number of comps in successful searches in an 308-element array = 2270 Match! Avg = 7.37012987012987 Approximate low value of avg = 7.271463027904375 Approximate high value of avg = 7.371463027904374 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(308) = 2578 >>> Theoretic accumulative number of comps in unsuccessful searches in an 308-element array = 2578 Match! Avg = 8.343042071197411 Approximate low value of avg = 8.271463027904375 Approximate high value of avg = 8.371463027904374 Fits in! Difference between the unsuccessful and successful = 0.9729122010675413 *** 309-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(309) = 2279 >>> Theoretic accumulative number of comps in successful searches in an 309-element array = 2279 Match! Avg = 7.375404530744337 Approximate low value of avg = 7.276124405274238 Approximate high value of avg = 7.376124405274238 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(309) = 2588 >>> Theoretic accumulative number of comps in unsuccessful searches in an 309-element array = 2588 Match! Avg = 8.348387096774193 Approximate low value of avg = 8.276124405274238 Approximate high value of avg = 8.376124405274238 Fits in! Difference between the unsuccessful and successful = 0.9729825660298559 *** 310-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(310) = 2288 >>> Theoretic accumulative number of comps in successful searches in an 310-element array = 2288 Match! Avg = 7.380645161290323 Approximate low value of avg = 7.280770770130603 Approximate high value of avg = 7.380770770130603 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(310) = 2598 >>> Theoretic accumulative number of comps in unsuccessful searches in an 310-element array = 2598 Match! Avg = 8.353697749196142 Approximate low value of avg = 8.280770770130603 Approximate high value of avg = 8.380770770130603 Fits in! Difference between the unsuccessful and successful = 0.9730525879058192 *** 311-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(311) = 2297 >>> Theoretic accumulative number of comps in successful searches in an 311-element array = 2297 Match! Avg = 7.385852090032154 Approximate low value of avg = 7.285402218862249 Approximate high value of avg = 7.385402218862248 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(311) = 2608 >>> Theoretic accumulative number of comps in unsuccessful searches in an 311-element array = 2608 Match! Avg = 8.35897435897436 Approximate low value of avg = 8.285402218862249 Approximate high value of avg = 8.385402218862248 Fits in! Difference between the unsuccessful and successful = 0.9731222689422054 *** 312-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(312) = 2306 >>> Theoretic accumulative number of comps in successful searches in an 312-element array = 2306 Match! Avg = 7.391025641025641 Approximate low value of avg = 7.290018846932618 Approximate high value of avg = 7.390018846932618 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(312) = 2618 >>> Theoretic accumulative number of comps in unsuccessful searches in an 312-element array = 2618 Match! Avg = 8.364217252396166 Approximate low value of avg = 8.290018846932618 Approximate high value of avg = 8.390018846932618 Fits in! Difference between the unsuccessful and successful = 0.9731916113705248 *** 313-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(313) = 2315 >>> Theoretic accumulative number of comps in successful searches in an 313-element array = 2315 Match! Avg = 7.396166134185304 Approximate low value of avg = 7.294620748891626 Approximate high value of avg = 7.394620748891626 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(313) = 2628 >>> Theoretic accumulative number of comps in unsuccessful searches in an 313-element array = 2628 Match! Avg = 8.369426751592357 Approximate low value of avg = 8.294620748891626 Approximate high value of avg = 8.394620748891626 Fits in! Difference between the unsuccessful and successful = 0.9732606174070533 *** 314-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(314) = 2324 >>> Theoretic accumulative number of comps in successful searches in an 314-element array = 2324 Match! Avg = 7.401273885350318 Approximate low value of avg = 7.299208018387279 Approximate high value of avg = 7.399208018387279 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(314) = 2638 >>> Theoretic accumulative number of comps in unsuccessful searches in an 314-element array = 2638 Match! Avg = 8.374603174603175 Approximate low value of avg = 8.29920801838728 Approximate high value of avg = 8.399208018387279 Fits in! Difference between the unsuccessful and successful = 0.9733292892528569 *** 315-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(315) = 2333 >>> Theoretic accumulative number of comps in successful searches in an 315-element array = 2333 Match! Avg = 7.406349206349207 Approximate low value of avg = 7.303780748177104 Approximate high value of avg = 7.403780748177104 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(315) = 2648 >>> Theoretic accumulative number of comps in unsuccessful searches in an 315-element array = 2648 Match! Avg = 8.379746835443038 Approximate low value of avg = 8.303780748177104 Approximate high value of avg = 8.403780748177104 Fits in! Difference between the unsuccessful and successful = 0.9733976290938315 *** 316-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(316) = 2342 >>> Theoretic accumulative number of comps in successful searches in an 316-element array = 2342 Match! Avg = 7.4113924050632916 Approximate low value of avg = 7.3083390301394076 Approximate high value of avg = 7.408339030139407 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(316) = 2658 >>> Theoretic accumulative number of comps in unsuccessful searches in an 316-element array = 2658 Match! Avg = 8.384858044164037 Approximate low value of avg = 8.308339030139408 Approximate high value of avg = 8.408339030139407 Fits in! Difference between the unsuccessful and successful = 0.9734656391007457 *** 317-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(317) = 2351 >>> Theoretic accumulative number of comps in successful searches in an 317-element array = 2351 Match! Avg = 7.416403785488959 Approximate low value of avg = 7.312882955284357 Approximate high value of avg = 7.412882955284356 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(317) = 2668 >>> Theoretic accumulative number of comps in unsuccessful searches in an 317-element array = 2668 Match! Avg = 8.38993710691824 Approximate low value of avg = 8.312882955284357 Approximate high value of avg = 8.412882955284356 Fits in! Difference between the unsuccessful and successful = 0.9735333214292803 *** 318-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(318) = 2360 >>> Theoretic accumulative number of comps in successful searches in an 318-element array = 2360 Match! Avg = 7.421383647798742 Approximate low value of avg = 7.317412613764869 Approximate high value of avg = 7.417412613764869 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(318) = 2678 >>> Theoretic accumulative number of comps in unsuccessful searches in an 318-element array = 2678 Match! Avg = 8.39498432601881 Approximate low value of avg = 8.31741261376487 Approximate high value of avg = 8.417412613764869 Fits in! Difference between the unsuccessful and successful = 0.973600678220067 *** 319-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(319) = 2369 >>> Theoretic accumulative number of comps in successful searches in an 319-element array = 2369 Match! Avg = 7.4263322884012535 Approximate low value of avg = 7.321928094887362 Approximate high value of avg = 7.421928094887361 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(319) = 2688 >>> Theoretic accumulative number of comps in unsuccessful searches in an 319-element array = 2688 Match! Avg = 8.4 Approximate low value of avg = 8.321928094887362 Approximate high value of avg = 8.421928094887361 Fits in! Difference between the unsuccessful and successful = 0.9736677115987469 *** 320-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(320) = 2378 >>> Theoretic accumulative number of comps in successful searches in an 320-element array = 2378 Match! Avg = 7.43125 Approximate low value of avg = 7.326429487122303 Approximate high value of avg = 7.426429487122302 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(320) = 2698 >>> Theoretic accumulative number of comps in unsuccessful searches in an 320-element array = 2698 Match! Avg = 8.404984423676012 Approximate low value of avg = 8.326429487122303 Approximate high value of avg = 8.426429487122302 Fits in! Difference between the unsuccessful and successful = 0.9737344236760119 *** 321-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(321) = 2387 >>> Theoretic accumulative number of comps in successful searches in an 321-element array = 2387 Match! Avg = 7.43613707165109 Approximate low value of avg = 7.330916878114618 Approximate high value of avg = 7.430916878114617 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(321) = 2708 >>> Theoretic accumulative number of comps in unsuccessful searches in an 321-element array = 2708 Match! Avg = 8.409937888198758 Approximate low value of avg = 8.330916878114618 Approximate high value of avg = 8.430916878114617 Fits in! Difference between the unsuccessful and successful = 0.9738008165476684 *** 322-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(322) = 2396 >>> Theoretic accumulative number of comps in successful searches in an 322-element array = 2396 Match! Avg = 7.440993788819876 Approximate low value of avg = 7.335390354693924 Approximate high value of avg = 7.435390354693924 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(322) = 2718 >>> Theoretic accumulative number of comps in unsuccessful searches in an 322-element array = 2718 Match! Avg = 8.41486068111455 Approximate low value of avg = 8.335390354693924 Approximate high value of avg = 8.435390354693924 Fits in! Difference between the unsuccessful and successful = 0.9738668922946747 *** 323-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(323) = 2405 >>> Theoretic accumulative number of comps in successful searches in an 323-element array = 2405 Match! Avg = 7.445820433436532 Approximate low value of avg = 7.339850002884624 Approximate high value of avg = 7.439850002884624 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(323) = 2728 >>> Theoretic accumulative number of comps in unsuccessful searches in an 323-element array = 2728 Match! Avg = 8.419753086419753 Approximate low value of avg = 8.339850002884624 Approximate high value of avg = 8.439850002884624 Fits in! Difference between the unsuccessful and successful = 0.9739326529832208 *** 324-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(324) = 2414 >>> Theoretic accumulative number of comps in successful searches in an 324-element array = 2414 Match! Avg = 7.450617283950617 Approximate low value of avg = 7.344295907915816 Approximate high value of avg = 7.444295907915816 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(324) = 2738 >>> Theoretic accumulative number of comps in unsuccessful searches in an 324-element array = 2738 Match! Avg = 8.424615384615384 Approximate low value of avg = 8.344295907915816 Approximate high value of avg = 8.444295907915816 Fits in! Difference between the unsuccessful and successful = 0.9739981006647671 *** 325-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(325) = 2423 >>> Theoretic accumulative number of comps in successful searches in an 325-element array = 2423 Match! Avg = 7.455384615384616 Approximate low value of avg = 7.348728154231077 Approximate high value of avg = 7.448728154231077 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(325) = 2748 >>> Theoretic accumulative number of comps in unsuccessful searches in an 325-element array = 2748 Match! Avg = 8.429447852760736 Approximate low value of avg = 8.348728154231077 Approximate high value of avg = 8.448728154231077 Fits in! Difference between the unsuccessful and successful = 0.9740632373761207 *** 326-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(326) = 2432 >>> Theoretic accumulative number of comps in successful searches in an 326-element array = 2432 Match! Avg = 7.460122699386503 Approximate low value of avg = 7.353146825498083 Approximate high value of avg = 7.453146825498083 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(326) = 2758 >>> Theoretic accumulative number of comps in unsuccessful searches in an 326-element array = 2758 Match! Avg = 8.434250764525993 Approximate low value of avg = 8.353146825498083 Approximate high value of avg = 8.453146825498083 Fits in! Difference between the unsuccessful and successful = 0.9741280651394906 *** 327-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(327) = 2441 >>> Theoretic accumulative number of comps in successful searches in an 327-element array = 2441 Match! Avg = 7.464831804281346 Approximate low value of avg = 7.357552004618084 Approximate high value of avg = 7.457552004618083 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(327) = 2768 >>> Theoretic accumulative number of comps in unsuccessful searches in an 327-element array = 2768 Match! Avg = 8.439024390243903 Approximate low value of avg = 8.357552004618084 Approximate high value of avg = 8.457552004618083 Fits in! Difference between the unsuccessful and successful = 0.9741925859625571 *** 328-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(328) = 2450 >>> Theoretic accumulative number of comps in successful searches in an 328-element array = 2450 Match! Avg = 7.469512195121951 Approximate low value of avg = 7.361943773735241 Approximate high value of avg = 7.461943773735241 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(328) = 2778 >>> Theoretic accumulative number of comps in unsuccessful searches in an 328-element array = 2778 Match! Avg = 8.443768996960486 Approximate low value of avg = 8.361943773735241 Approximate high value of avg = 8.461943773735241 Fits in! Difference between the unsuccessful and successful = 0.9742568018385347 *** 329-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(329) = 2459 >>> Theoretic accumulative number of comps in successful searches in an 329-element array = 2459 Match! Avg = 7.474164133738602 Approximate low value of avg = 7.366322214245816 Approximate high value of avg = 7.466322214245816 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(329) = 2788 >>> Theoretic accumulative number of comps in unsuccessful searches in an 329-element array = 2788 Match! Avg = 8.44848484848485 Approximate low value of avg = 8.366322214245816 Approximate high value of avg = 8.466322214245816 Fits in! Difference between the unsuccessful and successful = 0.9743207147462476 *** 330-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(330) = 2468 >>> Theoretic accumulative number of comps in successful searches in an 330-element array = 2468 Match! Avg = 7.4787878787878785 Approximate low value of avg = 7.3706874068072175 Approximate high value of avg = 7.470687406807217 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(330) = 2798 >>> Theoretic accumulative number of comps in unsuccessful searches in an 330-element array = 2798 Match! Avg = 8.453172205438067 Approximate low value of avg = 8.370687406807217 Approximate high value of avg = 8.470687406807217 Fits in! Difference between the unsuccessful and successful = 0.9743843266501884 *** 331-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(331) = 2477 >>> Theoretic accumulative number of comps in successful searches in an 331-element array = 2477 Match! Avg = 7.483383685800605 Approximate low value of avg = 7.375039431346924 Approximate high value of avg = 7.475039431346923 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(331) = 2808 >>> Theoretic accumulative number of comps in unsuccessful searches in an 331-element array = 2808 Match! Avg = 8.457831325301205 Approximate low value of avg = 8.375039431346924 Approximate high value of avg = 8.475039431346923 Fits in! Difference between the unsuccessful and successful = 0.9744476395006005 *** 332-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(332) = 2486 >>> Theoretic accumulative number of comps in successful searches in an 332-element array = 2486 Match! Avg = 7.4879518072289155 Approximate low value of avg = 7.379378367071263 Approximate high value of avg = 7.479378367071263 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(332) = 2818 >>> Theoretic accumulative number of comps in unsuccessful searches in an 332-element array = 2818 Match! Avg = 8.462462462462462 Approximate low value of avg = 8.379378367071263 Approximate high value of avg = 8.479378367071263 Fits in! Difference between the unsuccessful and successful = 0.9745106552335461 *** 333-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(333) = 2495 >>> Theoretic accumulative number of comps in successful searches in an 333-element array = 2495 Match! Avg = 7.4924924924924925 Approximate low value of avg = 7.383704292474054 Approximate high value of avg = 7.483704292474053 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(333) = 2828 >>> Theoretic accumulative number of comps in unsuccessful searches in an 333-element array = 2828 Match! Avg = 8.467065868263473 Approximate low value of avg = 8.383704292474054 Approximate high value of avg = 8.483704292474053 Fits in! Difference between the unsuccessful and successful = 0.9745733757709809 *** 334-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(334) = 2504 >>> Theoretic accumulative number of comps in successful searches in an 334-element array = 2504 Match! Avg = 7.497005988023952 Approximate low value of avg = 7.388017285345136 Approximate high value of avg = 7.488017285345135 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(334) = 2838 >>> Theoretic accumulative number of comps in unsuccessful searches in an 334-element array = 2838 Match! Avg = 8.471641791044776 Approximate low value of avg = 8.388017285345136 Approximate high value of avg = 8.488017285345135 Fits in! Difference between the unsuccessful and successful = 0.9746358030208242 *** 335-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(335) = 2513 >>> Theoretic accumulative number of comps in successful searches in an 335-element array = 2513 Match! Avg = 7.501492537313433 Approximate low value of avg = 7.39231742277876 Approximate high value of avg = 7.4923174227787595 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(335) = 2848 >>> Theoretic accumulative number of comps in unsuccessful searches in an 335-element array = 2848 Match! Avg = 8.476190476190476 Approximate low value of avg = 8.39231742277876 Approximate high value of avg = 8.49231742277876 Fits in! Difference between the unsuccessful and successful = 0.9746979388770436 *** 336-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(336) = 2522 >>> Theoretic accumulative number of comps in successful searches in an 336-element array = 2522 Match! Avg = 7.505952380952381 Approximate low value of avg = 7.396604781181859 Approximate high value of avg = 7.496604781181858 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(336) = 2858 >>> Theoretic accumulative number of comps in unsuccessful searches in an 336-element array = 2858 Match! Avg = 8.480712166172108 Approximate low value of avg = 8.396604781181859 Approximate high value of avg = 8.496604781181858 Fits in! Difference between the unsuccessful and successful = 0.9747597852197263 *** 337-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(337) = 2531 >>> Theoretic accumulative number of comps in successful searches in an 337-element array = 2531 Match! Avg = 7.510385756676558 Approximate low value of avg = 7.400879436282185 Approximate high value of avg = 7.500879436282185 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(337) = 2868 >>> Theoretic accumulative number of comps in unsuccessful searches in an 337-element array = 2868 Match! Avg = 8.485207100591715 Approximate low value of avg = 8.400879436282185 Approximate high value of avg = 8.500879436282185 Fits in! Difference between the unsuccessful and successful = 0.9748213439151572 *** 338-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(338) = 2540 >>> Theoretic accumulative number of comps in successful searches in an 338-element array = 2540 Match! Avg = 7.514792899408284 Approximate low value of avg = 7.405141463136344 Approximate high value of avg = 7.505141463136344 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(338) = 2878 >>> Theoretic accumulative number of comps in unsuccessful searches in an 338-element array = 2878 Match! Avg = 8.489675516224189 Approximate low value of avg = 8.405141463136344 Approximate high value of avg = 8.505141463136344 Fits in! Difference between the unsuccessful and successful = 0.974882616815905 *** 339-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(339) = 2549 >>> Theoretic accumulative number of comps in successful searches in an 339-element array = 2549 Match! Avg = 7.519174041297935 Approximate low value of avg = 7.409390936137703 Approximate high value of avg = 7.509390936137702 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(339) = 2888 >>> Theoretic accumulative number of comps in unsuccessful searches in an 339-element array = 2888 Match! Avg = 8.494117647058824 Approximate low value of avg = 8.409390936137703 Approximate high value of avg = 8.509390936137702 Fits in! Difference between the unsuccessful and successful = 0.9749436057608882 *** 340-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(340) = 2558 >>> Theoretic accumulative number of comps in successful searches in an 340-element array = 2558 Match! Avg = 7.523529411764706 Approximate low value of avg = 7.413627929024173 Approximate high value of avg = 7.513627929024173 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(340) = 2898 >>> Theoretic accumulative number of comps in unsuccessful searches in an 340-element array = 2898 Match! Avg = 8.498533724340176 Approximate low value of avg = 8.413627929024173 Approximate high value of avg = 8.513627929024173 Fits in! Difference between the unsuccessful and successful = 0.9750043125754697 *** 341-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(341) = 2567 >>> Theoretic accumulative number of comps in successful searches in an 341-element array = 2567 Match! Avg = 7.527859237536657 Approximate low value of avg = 7.417852514885897 Approximate high value of avg = 7.517852514885897 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(341) = 2908 >>> Theoretic accumulative number of comps in unsuccessful searches in an 341-element array = 2908 Match! Avg = 8.502923976608187 Approximate low value of avg = 8.417852514885897 Approximate high value of avg = 8.517852514885897 Fits in! Difference between the unsuccessful and successful = 0.9750647390715299 *** 342-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(342) = 2576 >>> Theoretic accumulative number of comps in successful searches in an 342-element array = 2576 Match! Avg = 7.5321637426900585 Approximate low value of avg = 7.422064766172811 Approximate high value of avg = 7.522064766172811 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(342) = 2918 >>> Theoretic accumulative number of comps in unsuccessful searches in an 342-element array = 2918 Match! Avg = 8.507288629737609 Approximate low value of avg = 8.422064766172811 Approximate high value of avg = 8.52206476617281 Fits in! Difference between the unsuccessful and successful = 0.9751248870475502 *** 343-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(343) = 2585 >>> Theoretic accumulative number of comps in successful searches in an 343-element array = 2585 Match! Avg = 7.536443148688047 Approximate low value of avg = 7.426264754702098 Approximate high value of avg = 7.5262647547020975 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(343) = 2928 >>> Theoretic accumulative number of comps in unsuccessful searches in an 343-element array = 2928 Match! Avg = 8.511627906976743 Approximate low value of avg = 8.426264754702098 Approximate high value of avg = 8.526264754702098 Fits in! Difference between the unsuccessful and successful = 0.9751847582886963 *** 344-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(344) = 2594 >>> Theoretic accumulative number of comps in successful searches in an 344-element array = 2594 Match! Avg = 7.540697674418604 Approximate low value of avg = 7.430452551665532 Approximate high value of avg = 7.530452551665531 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(344) = 2938 >>> Theoretic accumulative number of comps in unsuccessful searches in an 344-element array = 2938 Match! Avg = 8.515942028985508 Approximate low value of avg = 8.430452551665532 Approximate high value of avg = 8.530452551665531 Fits in! Difference between the unsuccessful and successful = 0.9752443545669038 *** 345-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(345) = 2603 >>> Theoretic accumulative number of comps in successful searches in an 345-element array = 2603 Match! Avg = 7.544927536231884 Approximate low value of avg = 7.4346282276367255 Approximate high value of avg = 7.534628227636725 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(345) = 2948 >>> Theoretic accumulative number of comps in unsuccessful searches in an 345-element array = 2948 Match! Avg = 8.520231213872833 Approximate low value of avg = 8.434628227636725 Approximate high value of avg = 8.534628227636725 Fits in! Difference between the unsuccessful and successful = 0.9753036776409489 *** 346-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(346) = 2612 >>> Theoretic accumulative number of comps in successful searches in an 346-element array = 2612 Match! Avg = 7.5491329479768785 Approximate low value of avg = 7.438791852578261 Approximate high value of avg = 7.53879185257826 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(346) = 2958 >>> Theoretic accumulative number of comps in unsuccessful searches in an 346-element array = 2958 Match! Avg = 8.52449567723343 Approximate low value of avg = 8.43879185257826 Approximate high value of avg = 8.53879185257826 Fits in! Difference between the unsuccessful and successful = 0.9753627292565517 *** 347-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(347) = 2621 >>> Theoretic accumulative number of comps in successful searches in an 347-element array = 2621 Match! Avg = 7.553314121037464 Approximate low value of avg = 7.442943495848729 Approximate high value of avg = 7.5429434958487285 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(347) = 2968 >>> Theoretic accumulative number of comps in unsuccessful searches in an 347-element array = 2968 Match! Avg = 8.528735632183908 Approximate low value of avg = 8.442943495848729 Approximate high value of avg = 8.542943495848728 Fits in! Difference between the unsuccessful and successful = 0.9754215111464442 *** 348-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(348) = 2630 >>> Theoretic accumulative number of comps in successful searches in an 348-element array = 2630 Match! Avg = 7.557471264367816 Approximate low value of avg = 7.447083226209653 Approximate high value of avg = 7.5470832262096526 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(348) = 2978 >>> Theoretic accumulative number of comps in unsuccessful searches in an 348-element array = 2978 Match! Avg = 8.53295128939828 Approximate low value of avg = 8.447083226209653 Approximate high value of avg = 8.547083226209653 Fits in! Difference between the unsuccessful and successful = 0.975480025030464 *** 349-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(349) = 2639 >>> Theoretic accumulative number of comps in successful searches in an 349-element array = 2639 Match! Avg = 7.56160458452722 Approximate low value of avg = 7.451211111832329 Approximate high value of avg = 7.551211111832329 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(349) = 2988 >>> Theoretic accumulative number of comps in unsuccessful searches in an 349-element array = 2988 Match! Avg = 8.537142857142857 Approximate low value of avg = 8.451211111832329 Approximate high value of avg = 8.551211111832329 Fits in! Difference between the unsuccessful and successful = 0.975538272615637 *** 350-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(350) = 2648 >>> Theoretic accumulative number of comps in successful searches in an 350-element array = 2648 Match! Avg = 7.565714285714286 Approximate low value of avg = 7.455327220304561 Approximate high value of avg = 7.5553272203045605 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(350) = 2998 >>> Theoretic accumulative number of comps in unsuccessful searches in an 350-element array = 2998 Match! Avg = 8.54131054131054 Approximate low value of avg = 8.45532722030456 Approximate high value of avg = 8.55532722030456 Fits in! Difference between the unsuccessful and successful = 0.9755962555962547 *** 351-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(351) = 2657 >>> Theoretic accumulative number of comps in successful searches in an 351-element array = 2657 Match! Avg = 7.56980056980057 Approximate low value of avg = 7.459431618637296 Approximate high value of avg = 7.559431618637296 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(351) = 3008 >>> Theoretic accumulative number of comps in unsuccessful searches in an 351-element array = 3008 Match! Avg = 8.545454545454545 Approximate low value of avg = 8.459431618637296 Approximate high value of avg = 8.559431618637296 Fits in! Difference between the unsuccessful and successful = 0.9756539756539748 *** 352-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(352) = 2666 >>> Theoretic accumulative number of comps in successful searches in an 352-element array = 2666 Match! Avg = 7.573863636363637 Approximate low value of avg = 7.463524373271181 Approximate high value of avg = 7.56352437327118 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(352) = 3018 >>> Theoretic accumulative number of comps in unsuccessful searches in an 352-element array = 3018 Match! Avg = 8.549575070821529 Approximate low value of avg = 8.46352437327118 Approximate high value of avg = 8.56352437327118 Fits in! Difference between the unsuccessful and successful = 0.9757114344578923 *** 353-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(353) = 2675 >>> Theoretic accumulative number of comps in successful searches in an 353-element array = 2675 Match! Avg = 7.577903682719547 Approximate low value of avg = 7.467605550082997 Approximate high value of avg = 7.567605550082996 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(353) = 3028 >>> Theoretic accumulative number of comps in unsuccessful searches in an 353-element array = 3028 Match! Avg = 8.55367231638418 Approximate low value of avg = 8.467605550082997 Approximate high value of avg = 8.567605550082996 Fits in! Difference between the unsuccessful and successful = 0.9757686336646332 *** 354-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(354) = 2684 >>> Theoretic accumulative number of comps in successful searches in an 354-element array = 2684 Match! Avg = 7.581920903954802 Approximate low value of avg = 7.471675214392045 Approximate high value of avg = 7.5716752143920445 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(354) = 3038 >>> Theoretic accumulative number of comps in unsuccessful searches in an 354-element array = 3038 Match! Avg = 8.55774647887324 Approximate low value of avg = 8.471675214392045 Approximate high value of avg = 8.571675214392044 Fits in! Difference between the unsuccessful and successful = 0.9758255749184377 *** 355-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(355) = 2693 >>> Theoretic accumulative number of comps in successful searches in an 355-element array = 2693 Match! Avg = 7.585915492957747 Approximate low value of avg = 7.4757334309663985 Approximate high value of avg = 7.575733430966398 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(355) = 3048 >>> Theoretic accumulative number of comps in unsuccessful searches in an 355-element array = 3048 Match! Avg = 8.561797752808989 Approximate low value of avg = 8.475733430966399 Approximate high value of avg = 8.575733430966398 Fits in! Difference between the unsuccessful and successful = 0.9758822598512422 *** 356-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(356) = 2702 >>> Theoretic accumulative number of comps in successful searches in an 356-element array = 2702 Match! Avg = 7.589887640449438 Approximate low value of avg = 7.479780264029099 Approximate high value of avg = 7.5797802640290985 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(356) = 3058 >>> Theoretic accumulative number of comps in unsuccessful searches in an 356-element array = 3058 Match! Avg = 8.565826330532213 Approximate low value of avg = 8.479780264029099 Approximate high value of avg = 8.579780264029099 Fits in! Difference between the unsuccessful and successful = 0.9759386900827742 *** 357-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(357) = 2711 >>> Theoretic accumulative number of comps in successful searches in an 357-element array = 2711 Match! Avg = 7.593837535014005 Approximate low value of avg = 7.483815777264256 Approximate high value of avg = 7.583815777264256 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(357) = 3068 >>> Theoretic accumulative number of comps in unsuccessful searches in an 357-element array = 3068 Match! Avg = 8.569832402234637 Approximate low value of avg = 8.483815777264256 Approximate high value of avg = 8.583815777264256 Fits in! Difference between the unsuccessful and successful = 0.9759948672206313 *** 358-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(358) = 2720 >>> Theoretic accumulative number of comps in successful searches in an 358-element array = 2720 Match! Avg = 7.597765363128492 Approximate low value of avg = 7.487840033823051 Approximate high value of avg = 7.587840033823051 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(358) = 3078 >>> Theoretic accumulative number of comps in unsuccessful searches in an 358-element array = 3078 Match! Avg = 8.573816155988858 Approximate low value of avg = 8.487840033823051 Approximate high value of avg = 8.587840033823051 Fits in! Difference between the unsuccessful and successful = 0.9760507928603666 *** 359-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(359) = 2729 >>> Theoretic accumulative number of comps in successful searches in an 359-element array = 2729 Match! Avg = 7.6016713091922 Approximate low value of avg = 7.491853096329676 Approximate high value of avg = 7.591853096329675 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(359) = 3088 >>> Theoretic accumulative number of comps in unsuccessful searches in an 359-element array = 3088 Match! Avg = 8.577777777777778 Approximate low value of avg = 8.491853096329676 Approximate high value of avg = 8.591853096329675 Fits in! Difference between the unsuccessful and successful = 0.9761064685855771 *** 360-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(360) = 2738 >>> Theoretic accumulative number of comps in successful searches in an 360-element array = 2738 Match! Avg = 7.605555555555555 Approximate low value of avg = 7.49585502688717 Approximate high value of avg = 7.59585502688717 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(360) = 3098 >>> Theoretic accumulative number of comps in unsuccessful searches in an 360-element array = 3098 Match! Avg = 8.581717451523545 Approximate low value of avg = 8.49585502688717 Approximate high value of avg = 8.59585502688717 Fits in! Difference between the unsuccessful and successful = 0.9761618959679899 *** 361-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(361) = 2747 >>> Theoretic accumulative number of comps in successful searches in an 361-element array = 2747 Match! Avg = 7.609418282548477 Approximate low value of avg = 7.499845887083206 Approximate high value of avg = 7.599845887083205 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(361) = 3108 >>> Theoretic accumulative number of comps in unsuccessful searches in an 361-element array = 3108 Match! Avg = 8.585635359116022 Approximate low value of avg = 8.499845887083206 Approximate high value of avg = 8.599845887083205 Fits in! Difference between the unsuccessful and successful = 0.9762170765675453 *** 362-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(362) = 2756 >>> Theoretic accumulative number of comps in successful searches in an 362-element array = 2756 Match! Avg = 7.613259668508287 Approximate low value of avg = 7.503825737995751 Approximate high value of avg = 7.60382573799575 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(362) = 3118 >>> Theoretic accumulative number of comps in unsuccessful searches in an 362-element array = 3118 Match! Avg = 8.589531680440771 Approximate low value of avg = 8.50382573799575 Approximate high value of avg = 8.60382573799575 Fits in! Difference between the unsuccessful and successful = 0.9762720119324841 *** 363-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(363) = 2765 >>> Theoretic accumulative number of comps in successful searches in an 363-element array = 2765 Match! Avg = 7.6170798898071626 Approximate low value of avg = 7.507794640198696 Approximate high value of avg = 7.607794640198696 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(363) = 3128 >>> Theoretic accumulative number of comps in unsuccessful searches in an 363-element array = 3128 Match! Avg = 8.593406593406593 Approximate low value of avg = 8.507794640198696 Approximate high value of avg = 8.607794640198696 Fits in! Difference between the unsuccessful and successful = 0.9763267035994305 *** 364-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(364) = 2774 >>> Theoretic accumulative number of comps in successful searches in an 364-element array = 2774 Match! Avg = 7.6208791208791204 Approximate low value of avg = 7.511752653767379 Approximate high value of avg = 7.611752653767379 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(364) = 3138 >>> Theoretic accumulative number of comps in unsuccessful searches in an 364-element array = 3138 Match! Avg = 8.597260273972603 Approximate low value of avg = 8.51175265376738 Approximate high value of avg = 8.611752653767379 Fits in! Difference between the unsuccessful and successful = 0.9763811530934827 *** 365-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(365) = 2783 >>> Theoretic accumulative number of comps in successful searches in an 365-element array = 2783 Match! Avg = 7.624657534246575 Approximate low value of avg = 7.515699838284043 Approximate high value of avg = 7.615699838284042 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(365) = 3148 >>> Theoretic accumulative number of comps in unsuccessful searches in an 365-element array = 3148 Match! Avg = 8.601092896174864 Approximate low value of avg = 8.515699838284043 Approximate high value of avg = 8.615699838284042 Fits in! Difference between the unsuccessful and successful = 0.9764353619282886 *** 366-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(366) = 2792 >>> Theoretic accumulative number of comps in successful searches in an 366-element array = 2792 Match! Avg = 7.628415300546448 Approximate low value of avg = 7.519636252843213 Approximate high value of avg = 7.619636252843213 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(366) = 3158 >>> Theoretic accumulative number of comps in unsuccessful searches in an 366-element array = 3158 Match! Avg = 8.60490463215259 Approximate low value of avg = 8.519636252843213 Approximate high value of avg = 8.619636252843213 Fits in! Difference between the unsuccessful and successful = 0.9764893316061416 *** 367-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(367) = 2801 >>> Theoretic accumulative number of comps in successful searches in an 367-element array = 2801 Match! Avg = 7.632152588555858 Approximate low value of avg = 7.523561956057014 Approximate high value of avg = 7.623561956057014 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(367) = 3168 >>> Theoretic accumulative number of comps in unsuccessful searches in an 367-element array = 3168 Match! Avg = 8.608695652173912 Approximate low value of avg = 8.523561956057014 Approximate high value of avg = 8.623561956057014 Fits in! Difference between the unsuccessful and successful = 0.9765430636180543 *** 368-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(368) = 2810 >>> Theoretic accumulative number of comps in successful searches in an 368-element array = 2810 Match! Avg = 7.635869565217392 Approximate low value of avg = 7.527477006060396 Approximate high value of avg = 7.627477006060396 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(368) = 3178 >>> Theoretic accumulative number of comps in unsuccessful searches in an 368-element array = 3178 Match! Avg = 8.612466124661246 Approximate low value of avg = 8.527477006060396 Approximate high value of avg = 8.627477006060396 Fits in! Difference between the unsuccessful and successful = 0.9765965594438546 *** 369-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(369) = 2819 >>> Theoretic accumulative number of comps in successful searches in an 369-element array = 2819 Match! Avg = 7.639566395663957 Approximate low value of avg = 7.531381460516313 Approximate high value of avg = 7.631381460516312 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(369) = 3188 >>> Theoretic accumulative number of comps in unsuccessful searches in an 369-element array = 3188 Match! Avg = 8.616216216216216 Approximate low value of avg = 8.531381460516313 Approximate high value of avg = 8.631381460516312 Fits in! Difference between the unsuccessful and successful = 0.9766498205522591 *** 370-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(370) = 2828 >>> Theoretic accumulative number of comps in successful searches in an 370-element array = 2828 Match! Avg = 7.643243243243243 Approximate low value of avg = 7.5352753766208025 Approximate high value of avg = 7.635275376620802 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(370) = 3198 >>> Theoretic accumulative number of comps in unsuccessful searches in an 370-element array = 3198 Match! Avg = 8.619946091644206 Approximate low value of avg = 8.535275376620802 Approximate high value of avg = 8.635275376620802 Fits in! Difference between the unsuccessful and successful = 0.9767028484009623 *** 371-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(371) = 2837 >>> Theoretic accumulative number of comps in successful searches in an 371-element array = 2837 Match! Avg = 7.646900269541779 Approximate low value of avg = 7.539158811108031 Approximate high value of avg = 7.639158811108031 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(371) = 3208 >>> Theoretic accumulative number of comps in unsuccessful searches in an 371-element array = 3208 Match! Avg = 8.623655913978494 Approximate low value of avg = 8.539158811108031 Approximate high value of avg = 8.63915881110803 Fits in! Difference between the unsuccessful and successful = 0.9767556444367154 *** 372-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(372) = 2846 >>> Theoretic accumulative number of comps in successful searches in an 372-element array = 2846 Match! Avg = 7.650537634408602 Approximate low value of avg = 7.543031820255239 Approximate high value of avg = 7.6430318202552385 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(372) = 3218 >>> Theoretic accumulative number of comps in unsuccessful searches in an 372-element array = 3218 Match! Avg = 8.627345844504022 Approximate low value of avg = 8.543031820255239 Approximate high value of avg = 8.643031820255239 Fits in! Difference between the unsuccessful and successful = 0.9768082100954203 *** 373-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(373) = 2855 >>> Theoretic accumulative number of comps in successful searches in an 373-element array = 2855 Match! Avg = 7.654155495978553 Approximate low value of avg = 7.546894459887637 Approximate high value of avg = 7.646894459887637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(373) = 3228 >>> Theoretic accumulative number of comps in unsuccessful searches in an 373-element array = 3228 Match! Avg = 8.631016042780749 Approximate low value of avg = 8.546894459887637 Approximate high value of avg = 8.646894459887637 Fits in! Difference between the unsuccessful and successful = 0.9768605468021958 *** 374-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(374) = 2864 >>> Theoretic accumulative number of comps in successful searches in an 374-element array = 2864 Match! Avg = 7.657754010695188 Approximate low value of avg = 7.550746785383243 Approximate high value of avg = 7.650746785383243 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(374) = 3238 >>> Theoretic accumulative number of comps in unsuccessful searches in an 374-element array = 3238 Match! Avg = 8.634666666666666 Approximate low value of avg = 8.550746785383243 Approximate high value of avg = 8.650746785383243 Fits in! Difference between the unsuccessful and successful = 0.9769126559714785 *** 375-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(375) = 2873 >>> Theoretic accumulative number of comps in successful searches in an 375-element array = 2873 Match! Avg = 7.661333333333333 Approximate low value of avg = 7.554588851677638 Approximate high value of avg = 7.654588851677637 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(375) = 3248 >>> Theoretic accumulative number of comps in unsuccessful searches in an 375-element array = 3248 Match! Avg = 8.638297872340425 Approximate low value of avg = 8.554588851677638 Approximate high value of avg = 8.654588851677637 Fits in! Difference between the unsuccessful and successful = 0.976964539007092 *** 376-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(376) = 2882 >>> Theoretic accumulative number of comps in successful searches in an 376-element array = 2882 Match! Avg = 7.664893617021277 Approximate low value of avg = 7.558420713268665 Approximate high value of avg = 7.658420713268665 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(376) = 3258 >>> Theoretic accumulative number of comps in unsuccessful searches in an 376-element array = 3258 Match! Avg = 8.641909814323608 Approximate low value of avg = 8.558420713268665 Approximate high value of avg = 8.658420713268665 Fits in! Difference between the unsuccessful and successful = 0.9770161973023308 *** 377-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(377) = 2891 >>> Theoretic accumulative number of comps in successful searches in an 377-element array = 2891 Match! Avg = 7.6684350132626 Approximate low value of avg = 7.562242424221074 Approximate high value of avg = 7.662242424221073 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(377) = 3268 >>> Theoretic accumulative number of comps in unsuccessful searches in an 377-element array = 3268 Match! Avg = 8.645502645502646 Approximate low value of avg = 8.562242424221074 Approximate high value of avg = 8.662242424221073 Fits in! Difference between the unsuccessful and successful = 0.977067632240046 *** 378-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(378) = 2900 >>> Theoretic accumulative number of comps in successful searches in an 378-element array = 2900 Match! Avg = 7.671957671957672 Approximate low value of avg = 7.566054038171092 Approximate high value of avg = 7.666054038171092 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(378) = 3278 >>> Theoretic accumulative number of comps in unsuccessful searches in an 378-element array = 3278 Match! Avg = 8.649076517150396 Approximate low value of avg = 8.566054038171092 Approximate high value of avg = 8.666054038171092 Fits in! Difference between the unsuccessful and successful = 0.9771188451927246 *** 379-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(379) = 2909 >>> Theoretic accumulative number of comps in successful searches in an 379-element array = 2909 Match! Avg = 7.675461741424802 Approximate low value of avg = 7.569855608330949 Approximate high value of avg = 7.669855608330948 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(379) = 3288 >>> Theoretic accumulative number of comps in unsuccessful searches in an 379-element array = 3288 Match! Avg = 8.652631578947368 Approximate low value of avg = 8.569855608330949 Approximate high value of avg = 8.669855608330948 Fits in! Difference between the unsuccessful and successful = 0.9771698375225659 *** 380-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(380) = 2918 >>> Theoretic accumulative number of comps in successful searches in an 380-element array = 2918 Match! Avg = 7.678947368421053 Approximate low value of avg = 7.573647187493323 Approximate high value of avg = 7.673647187493323 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(380) = 3298 >>> Theoretic accumulative number of comps in unsuccessful searches in an 380-element array = 3298 Match! Avg = 8.656167979002625 Approximate low value of avg = 8.573647187493323 Approximate high value of avg = 8.673647187493323 Fits in! Difference between the unsuccessful and successful = 0.977220610581572 *** 381-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(381) = 2927 >>> Theoretic accumulative number of comps in successful searches in an 381-element array = 2927 Match! Avg = 7.68241469816273 Approximate low value of avg = 7.57742882803575 Approximate high value of avg = 7.677428828035749 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(381) = 3308 >>> Theoretic accumulative number of comps in unsuccessful searches in an 381-element array = 3308 Match! Avg = 8.659685863874346 Approximate low value of avg = 8.57742882803575 Approximate high value of avg = 8.67742882803575 Fits in! Difference between the unsuccessful and successful = 0.977271165711616 *** 382-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(382) = 2936 >>> Theoretic accumulative number of comps in successful searches in an 382-element array = 2936 Match! Avg = 7.68586387434555 Approximate low value of avg = 7.581200581924957 Approximate high value of avg = 7.681200581924957 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(382) = 3318 >>> Theoretic accumulative number of comps in unsuccessful searches in an 382-element array = 3318 Match! Avg = 8.663185378590079 Approximate low value of avg = 8.581200581924957 Approximate high value of avg = 8.681200581924957 Fits in! Difference between the unsuccessful and successful = 0.9773215042445287 *** 383-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(383) = 2945 >>> Theoretic accumulative number of comps in successful searches in an 383-element array = 2945 Match! Avg = 7.689295039164491 Approximate low value of avg = 7.584962500721156 Approximate high value of avg = 7.684962500721156 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(383) = 3328 >>> Theoretic accumulative number of comps in unsuccessful searches in an 383-element array = 3328 Match! Avg = 8.666666666666666 Approximate low value of avg = 8.584962500721156 Approximate high value of avg = 8.684962500721156 Fits in! Difference between the unsuccessful and successful = 0.9773716275021753 *** 384-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(384) = 2954 >>> Theoretic accumulative number of comps in successful searches in an 384-element array = 2954 Match! Avg = 7.692708333333333 Approximate low value of avg = 7.5887146355822654 Approximate high value of avg = 7.688714635582265 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(384) = 3338 >>> Theoretic accumulative number of comps in unsuccessful searches in an 384-element array = 3338 Match! Avg = 8.67012987012987 Approximate low value of avg = 8.588714635582265 Approximate high value of avg = 8.688714635582265 Fits in! Difference between the unsuccessful and successful = 0.9774215367965366 *** 385-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(385) = 2963 >>> Theoretic accumulative number of comps in successful searches in an 385-element array = 2963 Match! Avg = 7.696103896103896 Approximate low value of avg = 7.5924570372680815 Approximate high value of avg = 7.692457037268081 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(385) = 3348 >>> Theoretic accumulative number of comps in unsuccessful searches in an 385-element array = 3348 Match! Avg = 8.67357512953368 Approximate low value of avg = 8.592457037268082 Approximate high value of avg = 8.692457037268081 Fits in! Difference between the unsuccessful and successful = 0.9774712334297835 *** 386-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(386) = 2972 >>> Theoretic accumulative number of comps in successful searches in an 386-element array = 2972 Match! Avg = 7.699481865284974 Approximate low value of avg = 7.59618975614441 Approximate high value of avg = 7.69618975614441 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(386) = 3358 >>> Theoretic accumulative number of comps in unsuccessful searches in an 386-element array = 3358 Match! Avg = 8.677002583979329 Approximate low value of avg = 8.59618975614441 Approximate high value of avg = 8.69618975614441 Fits in! Difference between the unsuccessful and successful = 0.9775207186943549 *** 387-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(387) = 2981 >>> Theoretic accumulative number of comps in successful searches in an 387-element array = 2981 Match! Avg = 7.702842377260982 Approximate low value of avg = 7.599912842187129 Approximate high value of avg = 7.699912842187128 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(387) = 3368 >>> Theoretic accumulative number of comps in unsuccessful searches in an 387-element array = 3368 Match! Avg = 8.68041237113402 Approximate low value of avg = 8.599912842187129 Approximate high value of avg = 8.699912842187128 Fits in! Difference between the unsuccessful and successful = 0.977569993873038 *** 388-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(388) = 2990 >>> Theoretic accumulative number of comps in successful searches in an 388-element array = 2990 Match! Avg = 7.706185567010309 Approximate low value of avg = 7.603626344986191 Approximate high value of avg = 7.703626344986191 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(388) = 3378 >>> Theoretic accumulative number of comps in unsuccessful searches in an 388-element array = 3378 Match! Avg = 8.683804627249357 Approximate low value of avg = 8.603626344986191 Approximate high value of avg = 8.70362634498619 Fits in! Difference between the unsuccessful and successful = 0.9776190602390473 *** 389-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(389) = 2999 >>> Theoretic accumulative number of comps in successful searches in an 389-element array = 2999 Match! Avg = 7.709511568123394 Approximate low value of avg = 7.60733031374961 Approximate high value of avg = 7.70733031374961 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(389) = 3388 >>> Theoretic accumulative number of comps in unsuccessful searches in an 389-element array = 3388 Match! Avg = 8.687179487179487 Approximate low value of avg = 8.60733031374961 Approximate high value of avg = 8.70733031374961 Fits in! Difference between the unsuccessful and successful = 0.9776679190560928 *** 390-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(390) = 3008 >>> Theoretic accumulative number of comps in successful searches in an 390-element array = 3008 Match! Avg = 7.712820512820513 Approximate low value of avg = 7.611024797307353 Approximate high value of avg = 7.711024797307353 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(390) = 3398 >>> Theoretic accumulative number of comps in unsuccessful searches in an 390-element array = 3398 Match! Avg = 8.690537084398978 Approximate low value of avg = 8.611024797307353 Approximate high value of avg = 8.711024797307353 Fits in! Difference between the unsuccessful and successful = 0.9777165715784646 *** 391-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(391) = 3017 >>> Theoretic accumulative number of comps in successful searches in an 391-element array = 3017 Match! Avg = 7.716112531969309 Approximate low value of avg = 7.6147098441152075 Approximate high value of avg = 7.714709844115207 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(391) = 3408 >>> Theoretic accumulative number of comps in unsuccessful searches in an 391-element array = 3408 Match! Avg = 8.693877551020408 Approximate low value of avg = 8.614709844115207 Approximate high value of avg = 8.714709844115207 Fits in! Difference between the unsuccessful and successful = 0.9777650190510991 *** 392-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(392) = 3026 >>> Theoretic accumulative number of comps in successful searches in an 392-element array = 3026 Match! Avg = 7.719387755102041 Approximate low value of avg = 7.618385502258606 Approximate high value of avg = 7.718385502258606 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(392) = 3418 >>> Theoretic accumulative number of comps in unsuccessful searches in an 392-element array = 3418 Match! Avg = 8.697201017811706 Approximate low value of avg = 8.618385502258606 Approximate high value of avg = 8.718385502258606 Fits in! Difference between the unsuccessful and successful = 0.977813262709665 *** 393-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(393) = 3035 >>> Theoretic accumulative number of comps in successful searches in an 393-element array = 3035 Match! Avg = 7.7226463104325695 Approximate low value of avg = 7.622051819456377 Approximate high value of avg = 7.722051819456377 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(393) = 3428 >>> Theoretic accumulative number of comps in unsuccessful searches in an 393-element array = 3428 Match! Avg = 8.700507614213198 Approximate low value of avg = 8.622051819456377 Approximate high value of avg = 8.722051819456377 Fits in! Difference between the unsuccessful and successful = 0.9778613037806281 *** 394-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(394) = 3044 >>> Theoretic accumulative number of comps in successful searches in an 394-element array = 3044 Match! Avg = 7.725888324873097 Approximate low value of avg = 7.625708843064466 Approximate high value of avg = 7.725708843064465 Does NOT fit in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(394) = 3438 >>> Theoretic accumulative number of comps in unsuccessful searches in an 394-element array = 3438 Match! Avg = 8.70379746835443 Approximate low value of avg = 8.625708843064466 Approximate high value of avg = 8.725708843064465 Fits in! Difference between the unsuccessful and successful = 0.9779091434813338 *** 395-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(395) = 3053 >>> Theoretic accumulative number of comps in successful searches in an 395-element array = 3053 Match! Avg = 7.729113924050633 Approximate low value of avg = 7.62935662007961 Approximate high value of avg = 7.72935662007961 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(395) = 3448 >>> Theoretic accumulative number of comps in unsuccessful searches in an 395-element array = 3448 Match! Avg = 8.707070707070708 Approximate low value of avg = 8.62935662007961 Approximate high value of avg = 8.72935662007961 Fits in! Difference between the unsuccessful and successful = 0.9779567830200744 *** 396-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(396) = 3062 >>> Theoretic accumulative number of comps in successful searches in an 396-element array = 3062 Match! Avg = 7.732323232323233 Approximate low value of avg = 7.632995197142959 Approximate high value of avg = 7.732995197142959 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(396) = 3458 >>> Theoretic accumulative number of comps in unsuccessful searches in an 396-element array = 3458 Match! Avg = 8.710327455919396 Approximate low value of avg = 8.632995197142959 Approximate high value of avg = 8.732995197142959 Fits in! Difference between the unsuccessful and successful = 0.9780042235961632 *** 397-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(397) = 3071 >>> Theoretic accumulative number of comps in successful searches in an 397-element array = 3071 Match! Avg = 7.73551637279597 Approximate low value of avg = 7.63662462054365 Approximate high value of avg = 7.736624620543649 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(397) = 3468 >>> Theoretic accumulative number of comps in unsuccessful searches in an 397-element array = 3468 Match! Avg = 8.71356783919598 Approximate low value of avg = 8.63662462054365 Approximate high value of avg = 8.73662462054365 Fits in! Difference between the unsuccessful and successful = 0.97805146640001 *** 398-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(398) = 3080 >>> Theoretic accumulative number of comps in successful searches in an 398-element array = 3080 Match! Avg = 7.738693467336684 Approximate low value of avg = 7.640244936222347 Approximate high value of avg = 7.740244936222346 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(398) = 3478 >>> Theoretic accumulative number of comps in unsuccessful searches in an 398-element array = 3478 Match! Avg = 8.716791979949875 Approximate low value of avg = 8.640244936222347 Approximate high value of avg = 8.740244936222346 Fits in! Difference between the unsuccessful and successful = 0.9780985126131911 *** 399-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(399) = 3089 >>> Theoretic accumulative number of comps in successful searches in an 399-element array = 3089 Match! Avg = 7.741854636591479 Approximate low value of avg = 7.643856189774725 Approximate high value of avg = 7.743856189774725 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(399) = 3488 >>> Theoretic accumulative number of comps in unsuccessful searches in an 399-element array = 3488 Match! Avg = 8.72 Approximate low value of avg = 8.643856189774725 Approximate high value of avg = 8.743856189774725 Fits in! Difference between the unsuccessful and successful = 0.9781453634085215 *** 400-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(400) = 3098 >>> Theoretic accumulative number of comps in successful searches in an 400-element array = 3098 Match! Avg = 7.745 Approximate low value of avg = 7.6474584264549215 Approximate high value of avg = 7.747458426454921 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(400) = 3498 >>> Theoretic accumulative number of comps in unsuccessful searches in an 400-element array = 3498 Match! Avg = 8.723192019950124 Approximate low value of avg = 8.647458426454921 Approximate high value of avg = 8.747458426454921 Fits in! Difference between the unsuccessful and successful = 0.9781920199501242 [part of output removed] *** 9879-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9879) = 121937 >>> Theoretic accumulative number of comps in successful searches in an 9879-element array = 121937 Match! Avg = 12.343050916084623 Approximate low value of avg = 12.270295326472041 Approximate high value of avg = 12.370295326472041 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9879) = 131816 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9879-element array = 131816 Match! Avg = 13.3417004048583 Approximate low value of avg = 13.270295326472041 Approximate high value of avg = 13.370295326472041 Fits in! Difference between the unsuccessful and successful = 0.9986494887736761 *** 9880-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9880) = 121951 >>> Theoretic accumulative number of comps in successful searches in an 9880-element array = 121951 Match! Avg = 12.343218623481782 Approximate low value of avg = 12.270441340848047 Approximate high value of avg = 12.370441340848046 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9880) = 131831 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9880-element array = 131831 Match! Avg = 13.341868231960328 Approximate low value of avg = 13.270441340848047 Approximate high value of avg = 13.370441340848046 Fits in! Difference between the unsuccessful and successful = 0.9986496084785461 *** 9881-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9881) = 121965 >>> Theoretic accumulative number of comps in successful searches in an 9881-element array = 121965 Match! Avg = 12.34338629693351 Approximate low value of avg = 12.270587340447513 Approximate high value of avg = 12.370587340447512 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9881) = 131846 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9881-element array = 131846 Match! Avg = 13.342036025096135 Approximate low value of avg = 13.270587340447513 Approximate high value of avg = 13.370587340447512 Fits in! Difference between the unsuccessful and successful = 0.9986497281626256 *** 9882-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9882) = 121979 >>> Theoretic accumulative number of comps in successful searches in an 9882-element array = 121979 Match! Avg = 12.343553936450112 Approximate low value of avg = 12.270733325273428 Approximate high value of avg = 12.370733325273427 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9882) = 131861 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9882-element array = 131861 Match! Avg = 13.34220378427603 Approximate low value of avg = 13.270733325273428 Approximate high value of avg = 13.370733325273427 Fits in! Difference between the unsuccessful and successful = 0.9986498478259183 *** 9883-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9883) = 121993 >>> Theoretic accumulative number of comps in successful searches in an 9883-element array = 121993 Match! Avg = 12.34372154204189 Approximate low value of avg = 12.270879295328784 Approximate high value of avg = 12.370879295328784 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9883) = 131876 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9883-element array = 131876 Match! Avg = 13.34237150951032 Approximate low value of avg = 13.270879295328784 Approximate high value of avg = 13.370879295328784 Fits in! Difference between the unsuccessful and successful = 0.9986499674684293 *** 9884-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9884) = 122007 >>> Theoretic accumulative number of comps in successful searches in an 9884-element array = 122007 Match! Avg = 12.343889113719142 Approximate low value of avg = 12.271025250616571 Approximate high value of avg = 12.37102525061657 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9884) = 131891 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9884-element array = 131891 Match! Avg = 13.342539200809307 Approximate low value of avg = 13.271025250616571 Approximate high value of avg = 13.37102525061657 Fits in! Difference between the unsuccessful and successful = 0.9986500870901658 *** 9885-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9885) = 122021 >>> Theoretic accumulative number of comps in successful searches in an 9885-element array = 122021 Match! Avg = 12.34405665149216 Approximate low value of avg = 12.271171191139773 Approximate high value of avg = 12.371171191139773 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9885) = 131906 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9885-element array = 131906 Match! Avg = 13.34270685818329 Approximate low value of avg = 13.271171191139773 Approximate high value of avg = 13.371171191139773 Fits in! Difference between the unsuccessful and successful = 0.9986502066911296 *** 9886-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9886) = 122035 >>> Theoretic accumulative number of comps in successful searches in an 9886-element array = 122035 Match! Avg = 12.344224155371233 Approximate low value of avg = 12.271317116901379 Approximate high value of avg = 12.371317116901379 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9886) = 131921 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9886-element array = 131921 Match! Avg = 13.34287448164256 Approximate low value of avg = 13.271317116901379 Approximate high value of avg = 13.371317116901379 Fits in! Difference between the unsuccessful and successful = 0.9986503262713278 *** 9887-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9887) = 122049 >>> Theoretic accumulative number of comps in successful searches in an 9887-element array = 122049 Match! Avg = 12.344391625366644 Approximate low value of avg = 12.271463027904375 Approximate high value of avg = 12.371463027904374 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9887) = 131936 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9887-element array = 131936 Match! Avg = 13.343042071197411 Approximate low value of avg = 13.271463027904375 Approximate high value of avg = 13.371463027904374 Fits in! Difference between the unsuccessful and successful = 0.9986504458307675 *** 9888-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9888) = 122063 >>> Theoretic accumulative number of comps in successful searches in an 9888-element array = 122063 Match! Avg = 12.344559061488674 Approximate low value of avg = 12.271608924151744 Approximate high value of avg = 12.371608924151744 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9888) = 131951 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9888-element array = 131951 Match! Avg = 13.343209626858124 Approximate low value of avg = 13.271608924151744 Approximate high value of avg = 13.371608924151744 Fits in! Difference between the unsuccessful and successful = 0.9986505653694504 *** 9889-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9889) = 122077 >>> Theoretic accumulative number of comps in successful searches in an 9889-element array = 122077 Match! Avg = 12.344726463747598 Approximate low value of avg = 12.271754805646475 Approximate high value of avg = 12.371754805646475 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9889) = 131966 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9889-element array = 131966 Match! Avg = 13.343377148634985 Approximate low value of avg = 13.271754805646475 Approximate high value of avg = 13.371754805646475 Fits in! Difference between the unsuccessful and successful = 0.9986506848873873 *** 9890-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9890) = 122091 >>> Theoretic accumulative number of comps in successful searches in an 9890-element array = 122091 Match! Avg = 12.34489383215369 Approximate low value of avg = 12.271900672391544 Approximate high value of avg = 12.371900672391543 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9890) = 131981 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9890-element array = 131981 Match! Avg = 13.343544636538267 Approximate low value of avg = 13.271900672391544 Approximate high value of avg = 13.371900672391543 Fits in! Difference between the unsuccessful and successful = 0.9986508043845763 *** 9891-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9891) = 122105 >>> Theoretic accumulative number of comps in successful searches in an 9891-element array = 122105 Match! Avg = 12.345061166717217 Approximate low value of avg = 12.272046524389937 Approximate high value of avg = 12.372046524389937 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9891) = 131996 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9891-element array = 131996 Match! Avg = 13.343712090578245 Approximate low value of avg = 13.272046524389937 Approximate high value of avg = 13.372046524389937 Fits in! Difference between the unsuccessful and successful = 0.9986509238610282 *** 9892-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9892) = 122119 >>> Theoretic accumulative number of comps in successful searches in an 9892-element array = 122119 Match! Avg = 12.345228467448443 Approximate low value of avg = 12.272192361644638 Approximate high value of avg = 12.372192361644638 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9892) = 132011 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9892-element array = 132011 Match! Avg = 13.343879510765188 Approximate low value of avg = 13.272192361644638 Approximate high value of avg = 13.372192361644638 Fits in! Difference between the unsuccessful and successful = 0.9986510433167446 *** 9893-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9893) = 122133 >>> Theoretic accumulative number of comps in successful searches in an 9893-element array = 122133 Match! Avg = 12.345395734357627 Approximate low value of avg = 12.272338184158624 Approximate high value of avg = 12.372338184158624 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9893) = 132026 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9893-element array = 132026 Match! Avg = 13.34404689710936 Approximate low value of avg = 13.272338184158624 Approximate high value of avg = 13.372338184158624 Fits in! Difference between the unsuccessful and successful = 0.9986511627517327 *** 9894-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9894) = 122147 >>> Theoretic accumulative number of comps in successful searches in an 9894-element array = 122147 Match! Avg = 12.345562967455024 Approximate low value of avg = 12.272483991934877 Approximate high value of avg = 12.372483991934876 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9894) = 132041 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9894-element array = 132041 Match! Avg = 13.34421424962102 Approximate low value of avg = 13.272483991934877 Approximate high value of avg = 13.372483991934876 Fits in! Difference between the unsuccessful and successful = 0.9986512821659961 *** 9895-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9895) = 122161 >>> Theoretic accumulative number of comps in successful searches in an 9895-element array = 122161 Match! Avg = 12.345730166750885 Approximate low value of avg = 12.27262978497637 Approximate high value of avg = 12.37262978497637 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9895) = 132056 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9895-element array = 132056 Match! Avg = 13.344381568310428 Approximate low value of avg = 13.27262978497637 Approximate high value of avg = 13.37262978497637 Fits in! Difference between the unsuccessful and successful = 0.9986514015595436 *** 9896-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9896) = 122175 >>> Theoretic accumulative number of comps in successful searches in an 9896-element array = 122175 Match! Avg = 12.345897332255456 Approximate low value of avg = 12.272775563286087 Approximate high value of avg = 12.372775563286087 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9896) = 132071 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9896-element array = 132071 Match! Avg = 13.344548853187835 Approximate low value of avg = 13.272775563286087 Approximate high value of avg = 13.372775563286087 Fits in! Difference between the unsuccessful and successful = 0.9986515209323787 *** 9897-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9897) = 122189 >>> Theoretic accumulative number of comps in successful searches in an 9897-element array = 122189 Match! Avg = 12.346064463978983 Approximate low value of avg = 12.272921326867003 Approximate high value of avg = 12.372921326867003 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9897) = 132086 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9897-element array = 132086 Match! Avg = 13.344716104263487 Approximate low value of avg = 13.272921326867003 Approximate high value of avg = 13.372921326867003 Fits in! Difference between the unsuccessful and successful = 0.9986516402845034 *** 9898-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9898) = 122203 >>> Theoretic accumulative number of comps in successful searches in an 9898-element array = 122203 Match! Avg = 12.346231561931704 Approximate low value of avg = 12.273067075722095 Approximate high value of avg = 12.373067075722094 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9898) = 132101 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9898-element array = 132101 Match! Avg = 13.34488332154763 Approximate low value of avg = 13.273067075722095 Approximate high value of avg = 13.373067075722094 Fits in! Difference between the unsuccessful and successful = 0.9986517596159263 *** 9899-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9899) = 122217 >>> Theoretic accumulative number of comps in successful searches in an 9899-element array = 122217 Match! Avg = 12.34639862612385 Approximate low value of avg = 12.273212809854334 Approximate high value of avg = 12.373212809854333 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9899) = 132116 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9899-element array = 132116 Match! Avg = 13.345050505050505 Approximate low value of avg = 13.273212809854334 Approximate high value of avg = 13.373212809854333 Fits in! Difference between the unsuccessful and successful = 0.9986518789266547 *** 9900-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9900) = 122231 >>> Theoretic accumulative number of comps in successful searches in an 9900-element array = 122231 Match! Avg = 12.346565656565657 Approximate low value of avg = 12.2733585292667 Approximate high value of avg = 12.3733585292667 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9900) = 132131 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9900-element array = 132131 Match! Avg = 13.345217654782346 Approximate low value of avg = 13.2733585292667 Approximate high value of avg = 13.3733585292667 Fits in! Difference between the unsuccessful and successful = 0.9986519982166886 *** 9901-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9901) = 122245 >>> Theoretic accumulative number of comps in successful searches in an 9901-element array = 122245 Match! Avg = 12.346732653267347 Approximate low value of avg = 12.27350423396216 Approximate high value of avg = 12.37350423396216 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9901) = 132146 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9901-element array = 132146 Match! Avg = 13.345384770753384 Approximate low value of avg = 13.27350423396216 Approximate high value of avg = 13.37350423396216 Fits in! Difference between the unsuccessful and successful = 0.9986521174860368 *** 9902-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9902) = 122259 >>> Theoretic accumulative number of comps in successful searches in an 9902-element array = 122259 Match! Avg = 12.346899616239144 Approximate low value of avg = 12.273649923943694 Approximate high value of avg = 12.373649923943693 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9902) = 132161 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9902-element array = 132161 Match! Avg = 13.345551852973847 Approximate low value of avg = 13.273649923943694 Approximate high value of avg = 13.373649923943693 Fits in! Difference between the unsuccessful and successful = 0.9986522367347028 *** 9903-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9903) = 122273 >>> Theoretic accumulative number of comps in successful searches in an 9903-element array = 122273 Match! Avg = 12.347066545491264 Approximate low value of avg = 12.273795599214264 Approximate high value of avg = 12.373795599214263 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9903) = 132176 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9903-element array = 132176 Match! Avg = 13.345718901453958 Approximate low value of avg = 13.273795599214264 Approximate high value of avg = 13.373795599214263 Fits in! Difference between the unsuccessful and successful = 0.9986523559626939 *** 9904-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9904) = 122287 >>> Theoretic accumulative number of comps in successful searches in an 9904-element array = 122287 Match! Avg = 12.347233441033925 Approximate low value of avg = 12.273941259776848 Approximate high value of avg = 12.373941259776847 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9904) = 132191 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9904-element array = 132191 Match! Avg = 13.345885916203937 Approximate low value of avg = 13.273941259776848 Approximate high value of avg = 13.373941259776847 Fits in! Difference between the unsuccessful and successful = 0.9986524751700117 *** 9905-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9905) = 122301 >>> Theoretic accumulative number of comps in successful searches in an 9905-element array = 122301 Match! Avg = 12.347400302877334 Approximate low value of avg = 12.274086905634416 Approximate high value of avg = 12.374086905634416 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9905) = 132206 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9905-element array = 132206 Match! Avg = 13.346052897234 Approximate low value of avg = 13.274086905634416 Approximate high value of avg = 13.374086905634416 Fits in! Difference between the unsuccessful and successful = 0.9986525943566651 *** 9906-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9906) = 122315 >>> Theoretic accumulative number of comps in successful searches in an 9906-element array = 122315 Match! Avg = 12.347567131031697 Approximate low value of avg = 12.27423253678993 Approximate high value of avg = 12.374232536789929 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9906) = 132221 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9906-element array = 132221 Match! Avg = 13.346219844554355 Approximate low value of avg = 13.27423253678993 Approximate high value of avg = 13.374232536789929 Fits in! Difference between the unsuccessful and successful = 0.9986527135226577 *** 9907-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9907) = 122329 >>> Theoretic accumulative number of comps in successful searches in an 9907-element array = 122329 Match! Avg = 12.347733925507217 Approximate low value of avg = 12.274378153246364 Approximate high value of avg = 12.374378153246363 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9907) = 132236 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9907-element array = 132236 Match! Avg = 13.346386758175212 Approximate low value of avg = 13.274378153246364 Approximate high value of avg = 13.374378153246363 Fits in! Difference between the unsuccessful and successful = 0.9986528326679949 *** 9908-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9908) = 122343 >>> Theoretic accumulative number of comps in successful searches in an 9908-element array = 122343 Match! Avg = 12.34790068631409 Approximate low value of avg = 12.274523755006681 Approximate high value of avg = 12.374523755006681 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9908) = 132251 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9908-element array = 132251 Match! Avg = 13.346553638106771 Approximate low value of avg = 13.274523755006681 Approximate high value of avg = 13.374523755006681 Fits in! Difference between the unsuccessful and successful = 0.9986529517926819 *** 9909-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9909) = 122357 >>> Theoretic accumulative number of comps in successful searches in an 9909-element array = 122357 Match! Avg = 12.348067413462509 Approximate low value of avg = 12.27466934207385 Approximate high value of avg = 12.37466934207385 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9909) = 132266 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9909-element array = 132266 Match! Avg = 13.346720484359233 Approximate low value of avg = 13.27466934207385 Approximate high value of avg = 13.37466934207385 Fits in! Difference between the unsuccessful and successful = 0.9986530708967241 *** 9910-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9910) = 122371 >>> Theoretic accumulative number of comps in successful searches in an 9910-element array = 122371 Match! Avg = 12.348234106962664 Approximate low value of avg = 12.274814914450836 Approximate high value of avg = 12.374814914450836 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9910) = 132281 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9910-element array = 132281 Match! Avg = 13.346887296942791 Approximate low value of avg = 13.274814914450836 Approximate high value of avg = 13.374814914450836 Fits in! Difference between the unsuccessful and successful = 0.9986531899801268 *** 9911-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9911) = 122385 >>> Theoretic accumulative number of comps in successful searches in an 9911-element array = 122385 Match! Avg = 12.34840076682474 Approximate low value of avg = 12.2749604721406 Approximate high value of avg = 12.3749604721406 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9911) = 132296 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9911-element array = 132296 Match! Avg = 13.347054075867636 Approximate low value of avg = 13.2749604721406 Approximate high value of avg = 13.3749604721406 Fits in! Difference between the unsuccessful and successful = 0.9986533090428953 *** 9912-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9912) = 122399 >>> Theoretic accumulative number of comps in successful searches in an 9912-element array = 122399 Match! Avg = 12.348567393058918 Approximate low value of avg = 12.275106015146113 Approximate high value of avg = 12.375106015146113 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9912) = 132311 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9912-element array = 132311 Match! Avg = 13.347220821143953 Approximate low value of avg = 13.275106015146113 Approximate high value of avg = 13.375106015146113 Fits in! Difference between the unsuccessful and successful = 0.998653428085035 *** 9913-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9913) = 122413 >>> Theoretic accumulative number of comps in successful searches in an 9913-element array = 122413 Match! Avg = 12.348733985675375 Approximate low value of avg = 12.275251543470327 Approximate high value of avg = 12.375251543470327 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9913) = 132326 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9913-element array = 132326 Match! Avg = 13.347387532781925 Approximate low value of avg = 13.275251543470327 Approximate high value of avg = 13.375251543470327 Fits in! Difference between the unsuccessful and successful = 0.9986535471065494 *** 9914-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9914) = 122427 >>> Theoretic accumulative number of comps in successful searches in an 9914-element array = 122427 Match! Avg = 12.348900544684286 Approximate low value of avg = 12.275397057116209 Approximate high value of avg = 12.375397057116208 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9914) = 132341 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9914-element array = 132341 Match! Avg = 13.34755421079173 Approximate low value of avg = 13.275397057116209 Approximate high value of avg = 13.375397057116208 Fits in! Difference between the unsuccessful and successful = 0.9986536661074439 *** 9915-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9915) = 122441 >>> Theoretic accumulative number of comps in successful searches in an 9915-element array = 122441 Match! Avg = 12.349067070095815 Approximate low value of avg = 12.275542556086723 Approximate high value of avg = 12.375542556086723 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9915) = 132356 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9915-element array = 132356 Match! Avg = 13.347720855183542 Approximate low value of avg = 13.275542556086723 Approximate high value of avg = 13.375542556086723 Fits in! Difference between the unsuccessful and successful = 0.9986537850877273 *** 9916-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9916) = 122455 >>> Theoretic accumulative number of comps in successful searches in an 9916-element array = 122455 Match! Avg = 12.34923356192013 Approximate low value of avg = 12.275688040384823 Approximate high value of avg = 12.375688040384823 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9916) = 132371 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9916-element array = 132371 Match! Avg = 13.347887465967531 Approximate low value of avg = 13.275688040384823 Approximate high value of avg = 13.375688040384823 Fits in! Difference between the unsuccessful and successful = 0.9986539040474014 *** 9917-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9917) = 122469 >>> Theoretic accumulative number of comps in successful searches in an 9917-element array = 122469 Match! Avg = 12.349400020167389 Approximate low value of avg = 12.27583351001347 Approximate high value of avg = 12.37583351001347 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9917) = 132386 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9917-element array = 132386 Match! Avg = 13.348054043153862 Approximate low value of avg = 13.27583351001347 Approximate high value of avg = 13.37583351001347 Fits in! Difference between the unsuccessful and successful = 0.9986540229864733 *** 9918-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9918) = 122483 >>> Theoretic accumulative number of comps in successful searches in an 9918-element array = 122483 Match! Avg = 12.349566444847751 Approximate low value of avg = 12.275978964975621 Approximate high value of avg = 12.375978964975621 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9918) = 132401 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9918-element array = 132401 Match! Avg = 13.348220586752698 Approximate low value of avg = 13.275978964975621 Approximate high value of avg = 13.375978964975621 Fits in! Difference between the unsuccessful and successful = 0.9986541419049466 *** 9919-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9919) = 122497 >>> Theoretic accumulative number of comps in successful searches in an 9919-element array = 122497 Match! Avg = 12.349732835971368 Approximate low value of avg = 12.276124405274238 Approximate high value of avg = 12.376124405274238 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9919) = 132416 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9919-element array = 132416 Match! Avg = 13.348387096774193 Approximate low value of avg = 13.276124405274238 Approximate high value of avg = 13.376124405274238 Fits in! Difference between the unsuccessful and successful = 0.9986542608028248 *** 9920-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9920) = 122511 >>> Theoretic accumulative number of comps in successful searches in an 9920-element array = 122511 Match! Avg = 12.349899193548387 Approximate low value of avg = 12.276269830912272 Approximate high value of avg = 12.376269830912271 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9920) = 132431 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9920-element array = 132431 Match! Avg = 13.348553573228505 Approximate low value of avg = 13.276269830912272 Approximate high value of avg = 13.376269830912271 Fits in! Difference between the unsuccessful and successful = 0.9986543796801186 *** 9921-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9921) = 122525 >>> Theoretic accumulative number of comps in successful searches in an 9921-element array = 122525 Match! Avg = 12.350065517588952 Approximate low value of avg = 12.276415241892678 Approximate high value of avg = 12.376415241892678 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9921) = 132446 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9921-element array = 132446 Match! Avg = 13.348720016125782 Approximate low value of avg = 13.276415241892678 Approximate high value of avg = 13.376415241892678 Fits in! Difference between the unsuccessful and successful = 0.9986544985368297 *** 9922-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9922) = 122539 >>> Theoretic accumulative number of comps in successful searches in an 9922-element array = 122539 Match! Avg = 12.350231808103205 Approximate low value of avg = 12.276560638218415 Approximate high value of avg = 12.376560638218415 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9922) = 132461 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9922-element array = 132461 Match! Avg = 13.348886425476167 Approximate low value of avg = 13.276560638218415 Approximate high value of avg = 13.376560638218415 Fits in! Difference between the unsuccessful and successful = 0.9986546173729618 *** 9923-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9923) = 122553 >>> Theoretic accumulative number of comps in successful searches in an 9923-element array = 122553 Match! Avg = 12.35039806510128 Approximate low value of avg = 12.27670601989243 Approximate high value of avg = 12.37670601989243 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9923) = 132476 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9923-element array = 132476 Match! Avg = 13.349052801289803 Approximate low value of avg = 13.27670601989243 Approximate high value of avg = 13.37670601989243 Fits in! Difference between the unsuccessful and successful = 0.9986547361885236 *** 9924-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9924) = 122567 >>> Theoretic accumulative number of comps in successful searches in an 9924-element array = 122567 Match! Avg = 12.35056428859331 Approximate low value of avg = 12.276851386917684 Approximate high value of avg = 12.376851386917684 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9924) = 132491 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9924-element array = 132491 Match! Avg = 13.349219143576827 Approximate low value of avg = 13.276851386917684 Approximate high value of avg = 13.376851386917684 Fits in! Difference between the unsuccessful and successful = 0.998654854983517 *** 9925-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9925) = 122581 >>> Theoretic accumulative number of comps in successful searches in an 9925-element array = 122581 Match! Avg = 12.350730478589421 Approximate low value of avg = 12.27699673929712 Approximate high value of avg = 12.37699673929712 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9925) = 132506 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9925-element array = 132506 Match! Avg = 13.34938545234737 Approximate low value of avg = 13.27699673929712 Approximate high value of avg = 13.37699673929712 Fits in! Difference between the unsuccessful and successful = 0.9986549737579491 *** 9926-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9926) = 122595 >>> Theoretic accumulative number of comps in successful searches in an 9926-element array = 122595 Match! Avg = 12.350896635099739 Approximate low value of avg = 12.277142077033696 Approximate high value of avg = 12.377142077033696 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9926) = 132521 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9926-element array = 132521 Match! Avg = 13.349551727611564 Approximate low value of avg = 13.277142077033696 Approximate high value of avg = 13.377142077033696 Fits in! Difference between the unsuccessful and successful = 0.9986550925118252 *** 9927-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9927) = 122609 >>> Theoretic accumulative number of comps in successful searches in an 9927-element array = 122609 Match! Avg = 12.35106275813438 Approximate low value of avg = 12.277287400130357 Approximate high value of avg = 12.377287400130356 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9927) = 132536 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9927-element array = 132536 Match! Avg = 13.349717969379533 Approximate low value of avg = 13.277287400130357 Approximate high value of avg = 13.377287400130356 Fits in! Difference between the unsuccessful and successful = 0.9986552112451523 *** 9928-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9928) = 122623 >>> Theoretic accumulative number of comps in successful searches in an 9928-element array = 122623 Match! Avg = 12.351228847703466 Approximate low value of avg = 12.277432708590055 Approximate high value of avg = 12.377432708590055 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9928) = 132551 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9928-element array = 132551 Match! Avg = 13.349884177661396 Approximate low value of avg = 13.277432708590055 Approximate high value of avg = 13.377432708590055 Fits in! Difference between the unsuccessful and successful = 0.9986553299579306 *** 9929-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9929) = 122637 >>> Theoretic accumulative number of comps in successful searches in an 9929-element array = 122637 Match! Avg = 12.351394903817102 Approximate low value of avg = 12.277578002415737 Approximate high value of avg = 12.377578002415737 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9929) = 132566 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9929-element array = 132566 Match! Avg = 13.350050352467271 Approximate low value of avg = 13.277578002415737 Approximate high value of avg = 13.377578002415737 Fits in! Difference between the unsuccessful and successful = 0.9986554486501689 *** 9930-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9930) = 122651 >>> Theoretic accumulative number of comps in successful searches in an 9930-element array = 122651 Match! Avg = 12.351560926485398 Approximate low value of avg = 12.27772328161035 Approximate high value of avg = 12.377723281610349 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9930) = 132581 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9930-element array = 132581 Match! Avg = 13.35021649380727 Approximate low value of avg = 13.27772328161035 Approximate high value of avg = 13.377723281610349 Fits in! Difference between the unsuccessful and successful = 0.9986555673218724 *** 9931-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9931) = 122665 >>> Theoretic accumulative number of comps in successful searches in an 9931-element array = 122665 Match! Avg = 12.351726915718457 Approximate low value of avg = 12.27786854617684 Approximate high value of avg = 12.37786854617684 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9931) = 132596 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9931-element array = 132596 Match! Avg = 13.350382601691502 Approximate low value of avg = 13.27786854617684 Approximate high value of avg = 13.37786854617684 Fits in! Difference between the unsuccessful and successful = 0.9986556859730449 *** 9932-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9932) = 122679 >>> Theoretic accumulative number of comps in successful searches in an 9932-element array = 122679 Match! Avg = 12.35189287152638 Approximate low value of avg = 12.278013796118154 Approximate high value of avg = 12.378013796118154 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9932) = 132611 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9932-element array = 132611 Match! Avg = 13.350548676130071 Approximate low value of avg = 13.278013796118154 Approximate high value of avg = 13.378013796118154 Fits in! Difference between the unsuccessful and successful = 0.9986558046036915 *** 9933-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9933) = 122693 >>> Theoretic accumulative number of comps in successful searches in an 9933-element array = 122693 Match! Avg = 12.352058793919259 Approximate low value of avg = 12.278159031437239 Approximate high value of avg = 12.378159031437239 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9933) = 132626 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9933-element array = 132626 Match! Avg = 13.350714717133078 Approximate low value of avg = 13.278159031437239 Approximate high value of avg = 13.378159031437239 Fits in! Difference between the unsuccessful and successful = 0.9986559232138195 *** 9934-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9934) = 122707 >>> Theoretic accumulative number of comps in successful searches in an 9934-element array = 122707 Match! Avg = 12.352224682907188 Approximate low value of avg = 12.278304252137032 Approximate high value of avg = 12.378304252137031 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9934) = 132641 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9934-element array = 132641 Match! Avg = 13.350880724710619 Approximate low value of avg = 13.278304252137032 Approximate high value of avg = 13.378304252137031 Fits in! Difference between the unsuccessful and successful = 0.9986560418034305 *** 9935-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9935) = 122721 >>> Theoretic accumulative number of comps in successful searches in an 9935-element array = 122721 Match! Avg = 12.352390538500252 Approximate low value of avg = 12.278449458220482 Approximate high value of avg = 12.378449458220482 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9935) = 132656 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9935-element array = 132656 Match! Avg = 13.351046698872786 Approximate low value of avg = 13.278449458220482 Approximate high value of avg = 13.378449458220482 Fits in! Difference between the unsuccessful and successful = 0.9986561603725335 *** 9936-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9936) = 122735 >>> Theoretic accumulative number of comps in successful searches in an 9936-element array = 122735 Match! Avg = 12.352556360708535 Approximate low value of avg = 12.278594649690525 Approximate high value of avg = 12.378594649690525 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9936) = 132671 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9936-element array = 132671 Match! Avg = 13.351212639629667 Approximate low value of avg = 13.278594649690525 Approximate high value of avg = 13.378594649690525 Fits in! Difference between the unsuccessful and successful = 0.998656278921132 *** 9937-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9937) = 122749 >>> Theoretic accumulative number of comps in successful searches in an 9937-element array = 122749 Match! Avg = 12.352722149542116 Approximate low value of avg = 12.27873982655011 Approximate high value of avg = 12.37873982655011 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9937) = 132686 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9937-element array = 132686 Match! Avg = 13.351378546991347 Approximate low value of avg = 13.27873982655011 Approximate high value of avg = 13.37873982655011 Fits in! Difference between the unsuccessful and successful = 0.9986563974492313 *** 9938-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9938) = 122763 >>> Theoretic accumulative number of comps in successful searches in an 9938-element array = 122763 Match! Avg = 12.352887905011068 Approximate low value of avg = 12.27888498880217 Approximate high value of avg = 12.37888498880217 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9938) = 132701 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9938-element array = 132701 Match! Avg = 13.351544420967905 Approximate low value of avg = 13.27888498880217 Approximate high value of avg = 13.37888498880217 Fits in! Difference between the unsuccessful and successful = 0.9986565159568368 *** 9939-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9939) = 122777 >>> Theoretic accumulative number of comps in successful searches in an 9939-element array = 122777 Match! Avg = 12.353053627125465 Approximate low value of avg = 12.27903013644965 Approximate high value of avg = 12.37903013644965 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9939) = 132716 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9939-element array = 132716 Match! Avg = 13.351710261569416 Approximate low value of avg = 13.27903013644965 Approximate high value of avg = 13.37903013644965 Fits in! Difference between the unsuccessful and successful = 0.9986566344439503 *** 9940-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9940) = 122791 >>> Theoretic accumulative number of comps in successful searches in an 9940-element array = 122791 Match! Avg = 12.353219315895371 Approximate low value of avg = 12.279175269495482 Approximate high value of avg = 12.379175269495482 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9940) = 132731 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9940-element array = 132731 Match! Avg = 13.351876068805955 Approximate low value of avg = 13.279175269495482 Approximate high value of avg = 13.379175269495482 Fits in! Difference between the unsuccessful and successful = 0.9986567529105841 *** 9941-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9941) = 122805 >>> Theoretic accumulative number of comps in successful searches in an 9941-element array = 122805 Match! Avg = 12.353384971330852 Approximate low value of avg = 12.279320387942608 Approximate high value of avg = 12.379320387942608 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9941) = 132746 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9941-element array = 132746 Match! Avg = 13.352041842687589 Approximate low value of avg = 13.279320387942608 Approximate high value of avg = 13.379320387942608 Fits in! Difference between the unsuccessful and successful = 0.9986568713567365 *** 9942-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9942) = 122819 >>> Theoretic accumulative number of comps in successful searches in an 9942-element array = 122819 Match! Avg = 12.353550593441964 Approximate low value of avg = 12.279465491793964 Approximate high value of avg = 12.379465491793963 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9942) = 132761 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9942-element array = 132761 Match! Avg = 13.352207583224379 Approximate low value of avg = 13.279465491793964 Approximate high value of avg = 13.379465491793963 Fits in! Difference between the unsuccessful and successful = 0.9986569897824147 *** 9943-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9943) = 122833 >>> Theoretic accumulative number of comps in successful searches in an 9943-element array = 122833 Match! Avg = 12.353716182238761 Approximate low value of avg = 12.279610581052486 Approximate high value of avg = 12.379610581052486 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9943) = 132776 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9943-element array = 132776 Match! Avg = 13.352373290426387 Approximate low value of avg = 13.279610581052486 Approximate high value of avg = 13.379610581052486 Fits in! Difference between the unsuccessful and successful = 0.9986571081876257 *** 9944-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9944) = 122847 >>> Theoretic accumulative number of comps in successful searches in an 9944-element array = 122847 Match! Avg = 12.353881737731296 Approximate low value of avg = 12.279755655721107 Approximate high value of avg = 12.379755655721107 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9944) = 132791 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9944-element array = 132791 Match! Avg = 13.35253896430367 Approximate low value of avg = 13.279755655721107 Approximate high value of avg = 13.379755655721107 Fits in! Difference between the unsuccessful and successful = 0.9986572265723748 *** 9945-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9945) = 122861 >>> Theoretic accumulative number of comps in successful searches in an 9945-element array = 122861 Match! Avg = 12.354047259929613 Approximate low value of avg = 12.279900715802762 Approximate high value of avg = 12.379900715802762 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9945) = 132806 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9945-element array = 132806 Match! Avg = 13.352704604866277 Approximate low value of avg = 13.279900715802762 Approximate high value of avg = 13.379900715802762 Fits in! Difference between the unsuccessful and successful = 0.9986573449366638 *** 9946-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9946) = 122875 >>> Theoretic accumulative number of comps in successful searches in an 9946-element array = 122875 Match! Avg = 12.354212748843755 Approximate low value of avg = 12.280045761300384 Approximate high value of avg = 12.380045761300384 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9946) = 132821 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9946-element array = 132821 Match! Avg = 13.352870212124259 Approximate low value of avg = 13.280045761300384 Approximate high value of avg = 13.380045761300384 Fits in! Difference between the unsuccessful and successful = 0.9986574632805034 *** 9947-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9947) = 122889 >>> Theoretic accumulative number of comps in successful searches in an 9947-element array = 122889 Match! Avg = 12.354378204483764 Approximate low value of avg = 12.280190792216908 Approximate high value of avg = 12.380190792216908 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9947) = 132836 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9947-element array = 132836 Match! Avg = 13.353035786087656 Approximate low value of avg = 13.280190792216908 Approximate high value of avg = 13.380190792216908 Fits in! Difference between the unsuccessful and successful = 0.9986575816038918 *** 9948-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9948) = 122903 >>> Theoretic accumulative number of comps in successful searches in an 9948-element array = 122903 Match! Avg = 12.35454362685967 Approximate low value of avg = 12.280335808555261 Approximate high value of avg = 12.38033580855526 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9948) = 132851 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9948-element array = 132851 Match! Avg = 13.35320132676651 Approximate low value of avg = 13.280335808555261 Approximate high value of avg = 13.38033580855526 Fits in! Difference between the unsuccessful and successful = 0.9986576999068397 *** 9949-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9949) = 122917 >>> Theoretic accumulative number of comps in successful searches in an 9949-element array = 122917 Match! Avg = 12.354709015981506 Approximate low value of avg = 12.280480810318375 Approximate high value of avg = 12.380480810318375 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9949) = 132866 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9949-element array = 132866 Match! Avg = 13.353366834170854 Approximate low value of avg = 13.280480810318375 Approximate high value of avg = 13.380480810318375 Fits in! Difference between the unsuccessful and successful = 0.9986578181893488 *** 9950-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9950) = 122931 >>> Theoretic accumulative number of comps in successful searches in an 9950-element array = 122931 Match! Avg = 12.354874371859296 Approximate low value of avg = 12.28062579750918 Approximate high value of avg = 12.380625797509179 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9950) = 132881 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9950-element array = 132881 Match! Avg = 13.353532308310722 Approximate low value of avg = 13.28062579750918 Approximate high value of avg = 13.380625797509179 Fits in! Difference between the unsuccessful and successful = 0.9986579364514263 *** 9951-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9951) = 122945 >>> Theoretic accumulative number of comps in successful searches in an 9951-element array = 122945 Match! Avg = 12.355039694503064 Approximate low value of avg = 12.280770770130601 Approximate high value of avg = 12.380770770130601 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9951) = 132896 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9951-element array = 132896 Match! Avg = 13.353697749196142 Approximate low value of avg = 13.280770770130601 Approximate high value of avg = 13.380770770130601 Fits in! Difference between the unsuccessful and successful = 0.9986580546930774 *** 9952-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9952) = 122959 >>> Theoretic accumulative number of comps in successful searches in an 9952-element array = 122959 Match! Avg = 12.35520498392283 Approximate low value of avg = 12.280915728185574 Approximate high value of avg = 12.380915728185574 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9952) = 132911 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9952-element array = 132911 Match! Avg = 13.353863156837134 Approximate low value of avg = 13.280915728185574 Approximate high value of avg = 13.380915728185574 Fits in! Difference between the unsuccessful and successful = 0.998658172914304 *** 9953-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9953) = 122973 >>> Theoretic accumulative number of comps in successful searches in an 9953-element array = 122973 Match! Avg = 12.355370240128604 Approximate low value of avg = 12.28106067167702 Approximate high value of avg = 12.38106067167702 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9953) = 132926 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9953-element array = 132926 Match! Avg = 13.35402853124372 Approximate low value of avg = 13.28106067167702 Approximate high value of avg = 13.38106067167702 Fits in! Difference between the unsuccessful and successful = 0.9986582911151167 *** 9954-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9954) = 122987 >>> Theoretic accumulative number of comps in successful searches in an 9954-element array = 122987 Match! Avg = 12.3555354631304 Approximate low value of avg = 12.281205600607866 Approximate high value of avg = 12.381205600607865 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9954) = 132941 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9954-element array = 132941 Match! Avg = 13.354193872425917 Approximate low value of avg = 13.281205600607866 Approximate high value of avg = 13.381205600607865 Fits in! Difference between the unsuccessful and successful = 0.9986584092955173 *** 9955-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9955) = 123001 >>> Theoretic accumulative number of comps in successful searches in an 9955-element array = 123001 Match! Avg = 12.355700652938221 Approximate low value of avg = 12.281350514981035 Approximate high value of avg = 12.381350514981035 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9955) = 132956 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9955-element array = 132956 Match! Avg = 13.354359180393732 Approximate low value of avg = 13.281350514981035 Approximate high value of avg = 13.381350514981035 Fits in! Difference between the unsuccessful and successful = 0.9986585274555111 *** 9956-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9956) = 123015 >>> Theoretic accumulative number of comps in successful searches in an 9956-element array = 123015 Match! Avg = 12.355865809562074 Approximate low value of avg = 12.281495414799457 Approximate high value of avg = 12.381495414799456 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9956) = 132971 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9956-element array = 132971 Match! Avg = 13.354524455157176 Approximate low value of avg = 13.281495414799457 Approximate high value of avg = 13.381495414799456 Fits in! Difference between the unsuccessful and successful = 0.9986586455951016 *** 9957-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9957) = 123029 >>> Theoretic accumulative number of comps in successful searches in an 9957-element array = 123029 Match! Avg = 12.35603093301195 Approximate low value of avg = 12.28164030006605 Approximate high value of avg = 12.38164030006605 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9957) = 132986 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9957-element array = 132986 Match! Avg = 13.35468969672625 Approximate low value of avg = 13.28164030006605 Approximate high value of avg = 13.38164030006605 Fits in! Difference between the unsuccessful and successful = 0.9986587637142996 *** 9958-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9958) = 123043 >>> Theoretic accumulative number of comps in successful searches in an 9958-element array = 123043 Match! Avg = 12.356196023297851 Approximate low value of avg = 12.281785170783738 Approximate high value of avg = 12.381785170783738 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9958) = 133001 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9958-element array = 133001 Match! Avg = 13.354854905110955 Approximate low value of avg = 13.281785170783738 Approximate high value of avg = 13.381785170783738 Fits in! Difference between the unsuccessful and successful = 0.9986588818131032 *** 9959-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9959) = 123057 >>> Theoretic accumulative number of comps in successful searches in an 9959-element array = 123057 Match! Avg = 12.356361080429762 Approximate low value of avg = 12.281930026955443 Approximate high value of avg = 12.381930026955443 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9959) = 133016 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9959-element array = 133016 Match! Avg = 13.355020080321285 Approximate low value of avg = 13.281930026955443 Approximate high value of avg = 13.381930026955443 Fits in! Difference between the unsuccessful and successful = 0.9986589998915232 *** 9960-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9960) = 123071 >>> Theoretic accumulative number of comps in successful searches in an 9960-element array = 123071 Match! Avg = 12.356526104417672 Approximate low value of avg = 12.282074868584086 Approximate high value of avg = 12.382074868584086 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9960) = 133031 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9960-element array = 133031 Match! Avg = 13.355185222367233 Approximate low value of avg = 13.282074868584086 Approximate high value of avg = 13.382074868584086 Fits in! Difference between the unsuccessful and successful = 0.9986591179495612 *** 9961-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9961) = 123085 >>> Theoretic accumulative number of comps in successful searches in an 9961-element array = 123085 Match! Avg = 12.35669109527156 Approximate low value of avg = 12.28221969567259 Approximate high value of avg = 12.382219695672589 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9961) = 133046 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9961-element array = 133046 Match! Avg = 13.355350331258784 Approximate low value of avg = 13.28221969567259 Approximate high value of avg = 13.382219695672589 Fits in! Difference between the unsuccessful and successful = 0.9986592359872244 *** 9962-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9962) = 123099 >>> Theoretic accumulative number of comps in successful searches in an 9962-element array = 123099 Match! Avg = 12.356856053001405 Approximate low value of avg = 12.282364508223864 Approximate high value of avg = 12.382364508223864 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9962) = 133061 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9962-element array = 133061 Match! Avg = 13.355515407005923 Approximate low value of avg = 13.282364508223864 Approximate high value of avg = 13.382364508223864 Fits in! Difference between the unsuccessful and successful = 0.9986593540045181 *** 9963-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9963) = 123113 >>> Theoretic accumulative number of comps in successful searches in an 9963-element array = 123113 Match! Avg = 12.357020977617184 Approximate low value of avg = 12.282509306240836 Approximate high value of avg = 12.382509306240836 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9963) = 133076 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9963-element array = 133076 Match! Avg = 13.355680449618626 Approximate low value of avg = 13.282509306240836 Approximate high value of avg = 13.382509306240836 Fits in! Difference between the unsuccessful and successful = 0.9986594720014423 *** 9964-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9964) = 123127 >>> Theoretic accumulative number of comps in successful searches in an 9964-element array = 123127 Match! Avg = 12.357185869128864 Approximate low value of avg = 12.28265408972642 Approximate high value of avg = 12.382654089726419 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9964) = 133091 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9964-element array = 133091 Match! Avg = 13.355845459106874 Approximate low value of avg = 13.28265408972642 Approximate high value of avg = 13.382654089726419 Fits in! Difference between the unsuccessful and successful = 0.9986595899780095 *** 9965-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9965) = 123141 >>> Theoretic accumulative number of comps in successful searches in an 9965-element array = 123141 Match! Avg = 12.357350727546413 Approximate low value of avg = 12.282798858683533 Approximate high value of avg = 12.382798858683532 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9965) = 133106 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9965-element array = 133106 Match! Avg = 13.356010435480634 Approximate low value of avg = 13.282798858683533 Approximate high value of avg = 13.382798858683532 Fits in! Difference between the unsuccessful and successful = 0.9986597079342214 *** 9966-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9966) = 123155 >>> Theoretic accumulative number of comps in successful searches in an 9966-element array = 123155 Match! Avg = 12.357515552879791 Approximate low value of avg = 12.282943613115089 Approximate high value of avg = 12.382943613115089 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9966) = 133121 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9966-element array = 133121 Match! Avg = 13.356175378749874 Approximate low value of avg = 13.282943613115089 Approximate high value of avg = 13.382943613115089 Fits in! Difference between the unsuccessful and successful = 0.9986598258700834 *** 9967-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9967) = 123169 >>> Theoretic accumulative number of comps in successful searches in an 9967-element array = 123169 Match! Avg = 12.35768034513896 Approximate low value of avg = 12.283088353024002 Approximate high value of avg = 12.383088353024002 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9967) = 133136 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9967-element array = 133136 Match! Avg = 13.356340288924558 Approximate low value of avg = 13.283088353024002 Approximate high value of avg = 13.383088353024002 Fits in! Difference between the unsuccessful and successful = 0.998659943785599 *** 9968-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9968) = 123183 >>> Theoretic accumulative number of comps in successful searches in an 9968-element array = 123183 Match! Avg = 12.357845104333869 Approximate low value of avg = 12.283233078413188 Approximate high value of avg = 12.383233078413188 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9968) = 133151 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9968-element array = 133151 Match! Avg = 13.356505166014646 Approximate low value of avg = 13.283233078413188 Approximate high value of avg = 13.383233078413188 Fits in! Difference between the unsuccessful and successful = 0.998660061680777 *** 9969-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9969) = 123197 >>> Theoretic accumulative number of comps in successful searches in an 9969-element array = 123197 Match! Avg = 12.35800983047447 Approximate low value of avg = 12.283377789285558 Approximate high value of avg = 12.383377789285557 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9969) = 133166 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9969-element array = 133166 Match! Avg = 13.35667001003009 Approximate low value of avg = 13.283377789285558 Approximate high value of avg = 13.383377789285557 Fits in! Difference between the unsuccessful and successful = 0.9986601795556194 *** 9970-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9970) = 123211 >>> Theoretic accumulative number of comps in successful searches in an 9970-element array = 123211 Match! Avg = 12.358174523570712 Approximate low value of avg = 12.283522485644026 Approximate high value of avg = 12.383522485644026 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9970) = 133181 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9970-element array = 133181 Match! Avg = 13.356834820980845 Approximate low value of avg = 13.283522485644026 Approximate high value of avg = 13.383522485644026 Fits in! Difference between the unsuccessful and successful = 0.9986602974101331 *** 9971-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9971) = 123225 >>> Theoretic accumulative number of comps in successful searches in an 9971-element array = 123225 Match! Avg = 12.358339183632534 Approximate low value of avg = 12.283667167491501 Approximate high value of avg = 12.3836671674915 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9971) = 133196 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9971-element array = 133196 Match! Avg = 13.356999598876856 Approximate low value of avg = 13.283667167491501 Approximate high value of avg = 13.3836671674915 Fits in! Difference between the unsuccessful and successful = 0.9986604152443217 *** 9972-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9972) = 123239 >>> Theoretic accumulative number of comps in successful searches in an 9972-element array = 123239 Match! Avg = 12.358503810669875 Approximate low value of avg = 12.283811834830896 Approximate high value of avg = 12.383811834830896 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9972) = 133211 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9972-element array = 133211 Match! Avg = 13.357164343728066 Approximate low value of avg = 13.283811834830896 Approximate high value of avg = 13.383811834830896 Fits in! Difference between the unsuccessful and successful = 0.9986605330581906 *** 9973-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9973) = 123253 >>> Theoretic accumulative number of comps in successful searches in an 9973-element array = 123253 Match! Avg = 12.35866840469267 Approximate low value of avg = 12.283956487665115 Approximate high value of avg = 12.383956487665115 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9973) = 133226 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9973-element array = 133226 Match! Avg = 13.357329055544415 Approximate low value of avg = 13.283956487665115 Approximate high value of avg = 13.383956487665115 Fits in! Difference between the unsuccessful and successful = 0.998660650851745 *** 9974-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9974) = 123267 >>> Theoretic accumulative number of comps in successful searches in an 9974-element array = 123267 Match! Avg = 12.358832965710848 Approximate low value of avg = 12.28410112599707 Approximate high value of avg = 12.38410112599707 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9974) = 133241 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9974-element array = 133241 Match! Avg = 13.35749373433584 Approximate low value of avg = 13.28410112599707 Approximate high value of avg = 13.38410112599707 Fits in! Difference between the unsuccessful and successful = 0.9986607686249922 *** 9975-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9975) = 123281 >>> Theoretic accumulative number of comps in successful searches in an 9975-element array = 123281 Match! Avg = 12.358997493734336 Approximate low value of avg = 12.28424574982967 Approximate high value of avg = 12.38424574982967 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9975) = 133256 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9975-element array = 133256 Match! Avg = 13.35765838011227 Approximate low value of avg = 13.28424574982967 Approximate high value of avg = 13.38424574982967 Fits in! Difference between the unsuccessful and successful = 0.9986608863779338 *** 9976-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9976) = 123295 >>> Theoretic accumulative number of comps in successful searches in an 9976-element array = 123295 Match! Avg = 12.359161988773055 Approximate low value of avg = 12.28439035916582 Approximate high value of avg = 12.38439035916582 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9976) = 133271 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9976-element array = 133271 Match! Avg = 13.357822992883632 Approximate low value of avg = 13.28439035916582 Approximate high value of avg = 13.38439035916582 Fits in! Difference between the unsuccessful and successful = 0.998661004110577 *** 9977-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9977) = 123309 >>> Theoretic accumulative number of comps in successful searches in an 9977-element array = 123309 Match! Avg = 12.359326450836924 Approximate low value of avg = 12.284534954008427 Approximate high value of avg = 12.384534954008426 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9977) = 133286 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9977-element array = 133286 Match! Avg = 13.357987572659852 Approximate low value of avg = 13.284534954008427 Approximate high value of avg = 13.384534954008426 Fits in! Difference between the unsuccessful and successful = 0.9986611218229271 *** 9978-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9978) = 123323 >>> Theoretic accumulative number of comps in successful searches in an 9978-element array = 123323 Match! Avg = 12.359490879935858 Approximate low value of avg = 12.284679534360391 Approximate high value of avg = 12.38467953436039 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9978) = 133301 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9978-element array = 133301 Match! Avg = 13.358152119450846 Approximate low value of avg = 13.284679534360391 Approximate high value of avg = 13.38467953436039 Fits in! Difference between the unsuccessful and successful = 0.9986612395149876 *** 9979-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9979) = 123337 >>> Theoretic accumulative number of comps in successful searches in an 9979-element array = 123337 Match! Avg = 12.359655276079767 Approximate low value of avg = 12.284824100224624 Approximate high value of avg = 12.384824100224623 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9979) = 133316 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9979-element array = 133316 Match! Avg = 13.358316633266533 Approximate low value of avg = 13.284824100224624 Approximate high value of avg = 13.384824100224623 Fits in! Difference between the unsuccessful and successful = 0.9986613571867657 *** 9980-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9980) = 123351 >>> Theoretic accumulative number of comps in successful searches in an 9980-element array = 123351 Match! Avg = 12.359819639278557 Approximate low value of avg = 12.284968651604023 Approximate high value of avg = 12.384968651604023 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9980) = 133331 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9980-element array = 133331 Match! Avg = 13.358481114116822 Approximate low value of avg = 13.284968651604023 Approximate high value of avg = 13.384968651604023 Fits in! Difference between the unsuccessful and successful = 0.998661474838265 *** 9981-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9981) = 123365 >>> Theoretic accumulative number of comps in successful searches in an 9981-element array = 123365 Match! Avg = 12.35998396954213 Approximate low value of avg = 12.285113188501493 Approximate high value of avg = 12.385113188501492 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9981) = 133346 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9981-element array = 133346 Match! Avg = 13.35864556201162 Approximate low value of avg = 13.285113188501493 Approximate high value of avg = 13.385113188501492 Fits in! Difference between the unsuccessful and successful = 0.9986615924694906 *** 9982-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9982) = 123379 >>> Theoretic accumulative number of comps in successful searches in an 9982-element array = 123379 Match! Avg = 12.360148266880385 Approximate low value of avg = 12.285257710919934 Approximate high value of avg = 12.385257710919934 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9982) = 133361 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9982-element array = 133361 Match! Avg = 13.358809976960833 Approximate low value of avg = 13.285257710919934 Approximate high value of avg = 13.385257710919934 Fits in! Difference between the unsuccessful and successful = 0.998661710080448 *** 9983-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9983) = 123393 >>> Theoretic accumulative number of comps in successful searches in an 9983-element array = 123393 Match! Avg = 12.360312531303215 Approximate low value of avg = 12.285402218862249 Approximate high value of avg = 12.385402218862248 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9983) = 133376 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9983-element array = 133376 Match! Avg = 13.35897435897436 Approximate low value of avg = 13.285402218862249 Approximate high value of avg = 13.385402218862248 Fits in! Difference between the unsuccessful and successful = 0.9986618276711443 *** 9984-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9984) = 123407 >>> Theoretic accumulative number of comps in successful searches in an 9984-element array = 123407 Match! Avg = 12.360476762820513 Approximate low value of avg = 12.285546712331335 Approximate high value of avg = 12.385546712331335 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9984) = 133391 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9984-element array = 133391 Match! Avg = 13.359138708062094 Approximate low value of avg = 13.285546712331335 Approximate high value of avg = 13.385546712331335 Fits in! Difference between the unsuccessful and successful = 0.9986619452415813 *** 9985-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9985) = 123421 >>> Theoretic accumulative number of comps in successful searches in an 9985-element array = 123421 Match! Avg = 12.360640961442163 Approximate low value of avg = 12.285691191330095 Approximate high value of avg = 12.385691191330094 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9985) = 133406 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9985-element array = 133406 Match! Avg = 13.359303024233927 Approximate low value of avg = 13.285691191330095 Approximate high value of avg = 13.385691191330094 Fits in! Difference between the unsuccessful and successful = 0.9986620627917642 *** 9986-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9986) = 123435 >>> Theoretic accumulative number of comps in successful searches in an 9986-element array = 123435 Match! Avg = 12.360805127178049 Approximate low value of avg = 12.28583565586142 Approximate high value of avg = 12.38583565586142 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9986) = 133421 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9986-element array = 133421 Match! Avg = 13.35946730749975 Approximate low value of avg = 13.28583565586142 Approximate high value of avg = 13.38583565586142 Fits in! Difference between the unsuccessful and successful = 0.998662180321702 *** 9987-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9987) = 123449 >>> Theoretic accumulative number of comps in successful searches in an 9987-element array = 123449 Match! Avg = 12.360969260038049 Approximate low value of avg = 12.285980105928212 Approximate high value of avg = 12.385980105928212 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9987) = 133436 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9987-element array = 133436 Match! Avg = 13.359631557869443 Approximate low value of avg = 13.285980105928212 Approximate high value of avg = 13.385980105928212 Fits in! Difference between the unsuccessful and successful = 0.9986622978313946 *** 9988-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9988) = 123463 >>> Theoretic accumulative number of comps in successful searches in an 9988-element array = 123463 Match! Avg = 12.361133360032039 Approximate low value of avg = 12.286124541533368 Approximate high value of avg = 12.386124541533368 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9988) = 133451 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9988-element array = 133451 Match! Avg = 13.359795775352888 Approximate low value of avg = 13.286124541533368 Approximate high value of avg = 13.386124541533368 Fits in! Difference between the unsuccessful and successful = 0.9986624153208492 *** 9989-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9989) = 123477 >>> Theoretic accumulative number of comps in successful searches in an 9989-element array = 123477 Match! Avg = 12.361297427169887 Approximate low value of avg = 12.286268962679783 Approximate high value of avg = 12.386268962679782 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9989) = 133466 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9989-element array = 133466 Match! Avg = 13.35995995995996 Approximate low value of avg = 13.286268962679783 Approximate high value of avg = 13.386268962679782 Fits in! Difference between the unsuccessful and successful = 0.9986625327900729 *** 9990-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9990) = 123491 >>> Theoretic accumulative number of comps in successful searches in an 9990-element array = 123491 Match! Avg = 12.361461461461461 Approximate low value of avg = 12.286413369370347 Approximate high value of avg = 12.386413369370347 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9990) = 133481 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9990-element array = 133481 Match! Avg = 13.36012411170053 Approximate low value of avg = 13.286413369370347 Approximate high value of avg = 13.386413369370347 Fits in! Difference between the unsuccessful and successful = 0.9986626502390692 *** 9991-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9991) = 123505 >>> Theoretic accumulative number of comps in successful searches in an 9991-element array = 123505 Match! Avg = 12.361625462916624 Approximate low value of avg = 12.286557761607957 Approximate high value of avg = 12.386557761607957 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9991) = 133496 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9991-element array = 133496 Match! Avg = 13.360288230584468 Approximate low value of avg = 13.286557761607957 Approximate high value of avg = 13.386557761607957 Fits in! Difference between the unsuccessful and successful = 0.9986627676678435 *** 9992-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9992) = 123519 >>> Theoretic accumulative number of comps in successful searches in an 9992-element array = 123519 Match! Avg = 12.361789431545237 Approximate low value of avg = 12.286702139395507 Approximate high value of avg = 12.386702139395506 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9992) = 133511 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9992-element array = 133511 Match! Avg = 13.360452316621636 Approximate low value of avg = 13.286702139395507 Approximate high value of avg = 13.386702139395506 Fits in! Difference between the unsuccessful and successful = 0.9986628850763992 *** 9993-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9993) = 123533 >>> Theoretic accumulative number of comps in successful searches in an 9993-element array = 123533 Match! Avg = 12.36195336735715 Approximate low value of avg = 12.286846502735887 Approximate high value of avg = 12.386846502735887 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9993) = 133526 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9993-element array = 133526 Match! Avg = 13.360616369821892 Approximate low value of avg = 13.286846502735887 Approximate high value of avg = 13.386846502735887 Fits in! Difference between the unsuccessful and successful = 0.9986630024647418 *** 9994-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9994) = 123547 >>> Theoretic accumulative number of comps in successful searches in an 9994-element array = 123547 Match! Avg = 12.362117270362218 Approximate low value of avg = 12.286990851631991 Approximate high value of avg = 12.38699085163199 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9994) = 133541 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9994-element array = 133541 Match! Avg = 13.360780390195098 Approximate low value of avg = 13.286990851631991 Approximate high value of avg = 13.38699085163199 Fits in! Difference between the unsuccessful and successful = 0.9986631198328801 *** 9995-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9995) = 123561 >>> Theoretic accumulative number of comps in successful searches in an 9995-element array = 123561 Match! Avg = 12.362281140570285 Approximate low value of avg = 12.287135186086706 Approximate high value of avg = 12.387135186086706 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9995) = 133556 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9995-element array = 133556 Match! Avg = 13.3609443777511 Approximate low value of avg = 13.287135186086706 Approximate high value of avg = 13.387135186086706 Fits in! Difference between the unsuccessful and successful = 0.9986632371808142 *** 9996-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9996) = 123575 >>> Theoretic accumulative number of comps in successful searches in an 9996-element array = 123575 Match! Avg = 12.362444977991197 Approximate low value of avg = 12.287279506102921 Approximate high value of avg = 12.38727950610292 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9996) = 133571 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9996-element array = 133571 Match! Avg = 13.36110833249975 Approximate low value of avg = 13.287279506102921 Approximate high value of avg = 13.38727950610292 Fits in! Difference between the unsuccessful and successful = 0.9986633545085528 *** 9997-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9997) = 123589 >>> Theoretic accumulative number of comps in successful searches in an 9997-element array = 123589 Match! Avg = 12.36260878263479 Approximate low value of avg = 12.287423811683524 Approximate high value of avg = 12.387423811683524 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9997) = 133586 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9997-element array = 133586 Match! Avg = 13.36127225445089 Approximate low value of avg = 13.287423811683524 Approximate high value of avg = 13.387423811683524 Fits in! Difference between the unsuccessful and successful = 0.9986634718160996 *** 9998-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9998) = 123603 >>> Theoretic accumulative number of comps in successful searches in an 9998-element array = 123603 Match! Avg = 12.362772554510903 Approximate low value of avg = 12.287568102831404 Approximate high value of avg = 12.387568102831404 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9998) = 133601 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9998-element array = 133601 Match! Avg = 13.36143614361436 Approximate low value of avg = 13.287568102831404 Approximate high value of avg = 13.387568102831404 Fits in! Difference between the unsuccessful and successful = 0.9986635891034581 *** 9999-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9999) = 123617 >>> Theoretic accumulative number of comps in successful searches in an 9999-element array = 123617 Match! Avg = 12.362936293629362 Approximate low value of avg = 12.28771237954945 Approximate high value of avg = 12.38771237954945 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(9999) = 133616 >>> Theoretic accumulative number of comps in unsuccessful searches in an 9999-element array = 133616 Match! Avg = 13.3616 Approximate low value of avg = 13.28771237954945 Approximate high value of avg = 13.38771237954945 Fits in! Difference between the unsuccessful and successful = 0.9986637063706372 *** 10000-element sorted array to be searched *** Successful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(10000) = 123631 >>> Theoretic accumulative number of comps in successful searches in an 10000-element array = 123631 Match! Avg = 12.3631 Approximate low value of avg = 12.287856641840545 Approximate high value of avg = 12.387856641840544 Fits in! Unuccessful searches in Array >>> If values in the 2 following lines are exactly exactly equal then the theoretic result coincides with the running of the actual program. >>> Performed comps(10000) = 133631 >>> Theoretic accumulative number of comps in unsuccessful searches in an 10000-element array = 133631 Match! Avg = 13.361763823617638 Approximate low value of avg = 13.287856641840545 Approximate high value of avg = 13.387856641840544 Fits in! Difference between the unsuccessful and successful = 0.9986638236176386 All experiments matched theoretic values Some experiments did NOT fit between approximations Latest that did NOT was for N = 394 BUILD SUCCESSFUL (total time: 54 seconds)