fibonacci_recursive/our/1
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 285.63 ns | 286.45 ns | 287.43 ns |
| Throughput | 3.4792 Melem/s | 3.4911 Melem/s | 3.5010 Melem/s |
| R² | 0.9487720 | 0.9497523 | 0.9483369 |
| Mean | 285.80 ns | 288.06 ns | 290.99 ns |
| Std. Dev. | 4.5113 ns | 13.498 ns | 19.980 ns |
| Median | 284.90 ns | 285.41 ns | 285.99 ns |
| MAD | 1.7322 ns | 2.4422 ns | 3.1034 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.