fibonacci_recursive/our/4
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 995.25 ns | 999.99 ns | 1.0077 µs |
| Throughput | 3.9695 Melem/s | 4.0001 Melem/s | 4.0191 Melem/s |
| R² | 0.9301753 | 0.9328759 | 0.9257595 |
| Mean | 995.79 ns | 998.39 ns | 1.0021 µs |
| Std. Dev. | 3.8725 ns | 16.555 ns | 26.579 ns |
| Median | 994.10 ns | 994.56 ns | 995.32 ns |
| MAD | 1.4261 ns | 2.1264 ns | 2.9710 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.