fibonacci_recursive/our/1
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 388.59 ns | 389.23 ns | 390.17 ns |
| Throughput | 2.5630 Melem/s | 2.5692 Melem/s | 2.5734 Melem/s |
| R² | 0.9883726 | 0.9887391 | 0.9879299 |
| Mean | 388.86 ns | 389.92 ns | 391.39 ns |
| Std. Dev. | 1.9960 ns | 6.6575 ns | 10.577 ns |
| Median | 388.14 ns | 388.55 ns | 388.91 ns |
| MAD | 1.0582 ns | 1.5609 ns | 1.9122 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.