fibonacci_recursive/our/4
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.0795 µs | 1.0834 µs | 1.0895 µs |
| Throughput | 3.6713 Melem/s | 3.6920 Melem/s | 3.7056 Melem/s |
| R² | 0.9503611 | 0.9520821 | 0.9480605 |
| Mean | 1.0807 µs | 1.0851 µs | 1.0906 µs |
| Std. Dev. | 11.968 ns | 25.633 ns | 35.751 ns |
| Median | 1.0780 µs | 1.0787 µs | 1.0791 µs |
| MAD | 2.2445 ns | 3.0999 ns | 3.9830 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.