fibonacci_recursive/our/4
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.2629 µs | 1.2703 µs | 1.2824 µs |
| Throughput | 3.1190 Melem/s | 3.1488 Melem/s | 3.1672 Melem/s |
| R² | 0.7636060 | 0.7664082 | 0.7588915 |
| Mean | 1.2651 µs | 1.2751 µs | 1.2914 µs |
| Std. Dev. | 8.3574 ns | 70.007 ns | 115.92 ns |
| Median | 1.2622 µs | 1.2637 µs | 1.2661 µs |
| MAD | 4.4965 ns | 5.5694 ns | 7.0809 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.