fibonacci_recursive/our/1
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 413.08 ns | 413.86 ns | 414.93 ns |
| Throughput | 2.4100 Melem/s | 2.4163 Melem/s | 2.4208 Melem/s |
| R² | 0.9890145 | 0.9894887 | 0.9885724 |
| Mean | 413.35 ns | 414.71 ns | 416.87 ns |
| Std. Dev. | 2.3835 ns | 9.4307 ns | 15.592 ns |
| Median | 412.84 ns | 413.51 ns | 413.89 ns |
| MAD | 1.7248 ns | 2.2487 ns | 3.3318 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.