fibonacci_recursive/our/1
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 356.21 ns | 358.30 ns | 361.61 ns |
| Throughput | 2.7654 Melem/s | 2.7910 Melem/s | 2.8073 Melem/s |
| R² | 0.9473274 | 0.9499669 | 0.9433444 |
| Mean | 355.95 ns | 356.82 ns | 358.09 ns |
| Std. Dev. | 1.3458 ns | 5.6339 ns | 9.0847 ns |
| Median | 355.52 ns | 355.71 ns | 355.83 ns |
| MAD | 461.25 ps | 732.96 ps | 866.03 ps |
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.