fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.1923 µs | 1.1941 µs | 1.1966 µs |
| Throughput | 6.6853 Melem/s | 6.6996 Melem/s | 6.7096 Melem/s |
| R² | 0.9868035 | 0.9871100 | 0.9864976 |
| Mean | 1.1925 µs | 1.1946 µs | 1.1980 µs |
| Std. Dev. | 2.6774 ns | 15.030 ns | 25.188 ns |
| Median | 1.1919 µs | 1.1923 µs | 1.1927 µs |
| MAD | 1.1612 ns | 1.5714 ns | 2.6089 ns |
Understanding this report:
The plot on the left displays the average time per iteration for this benchmark. The shaded region shows the estimated probability of an iteration taking a certain amount of time, while the line shows the mean. Click on the plot for a larger view showing the outliers.
The plot on the right shows the linear regression calculated from the measurements. Each point represents a sample, though here it shows the total time for the sample rather than time per iteration. The line is the line of best fit for these measurements.
See the documentation for more details on the additional statistics.