fibonacci_recursive/our/2
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 598.86 ns | 599.57 ns | 600.33 ns |
| Throughput | 3.3315 Melem/s | 3.3357 Melem/s | 3.3397 Melem/s |
| R² | 0.9955207 | 0.9957111 | 0.9954843 |
| Mean | 598.19 ns | 598.97 ns | 599.80 ns |
| Std. Dev. | 2.9619 ns | 4.1052 ns | 5.3315 ns |
| Median | 598.17 ns | 598.58 ns | 599.39 ns |
| MAD | 2.2039 ns | 2.8485 ns | 3.9462 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.