fibonacci_recursive/our/8
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 999.18 ns | 1.0009 µs | 1.0031 µs |
| Throughput | 7.9751 Melem/s | 7.9927 Melem/s | 8.0066 Melem/s |
| R² | 0.9934907 | 0.9938973 | 0.9932317 |
| Mean | 998.77 ns | 999.88 ns | 1.0011 µs |
| Std. Dev. | 3.8273 ns | 5.9961 ns | 7.8197 ns |
| Median | 997.95 ns | 998.91 ns | 999.56 ns |
| MAD | 2.6216 ns | 3.4865 ns | 4.2370 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.