fibonacci_recursive/our/1
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 527.47 ns | 527.94 ns | 528.48 ns |
| Throughput | 1.8922 Melem/s | 1.8942 Melem/s | 1.8958 Melem/s |
| R² | 0.9968599 | 0.9969662 | 0.9968240 |
| Mean | 527.56 ns | 528.78 ns | 530.73 ns |
| Std. Dev. | 1.8529 ns | 8.5026 ns | 14.090 ns |
| Median | 527.04 ns | 527.41 ns | 527.80 ns |
| MAD | 1.2238 ns | 1.7564 ns | 1.9592 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.