fibonacci_recursive/our/2
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 547.02 ns | 547.73 ns | 548.69 ns |
| Throughput | 3.6450 Melem/s | 3.6514 Melem/s | 3.6562 Melem/s |
| R² | 0.9871926 | 0.9874207 | 0.9870028 |
| Mean | 547.30 ns | 548.78 ns | 550.71 ns |
| Std. Dev. | 3.4500 ns | 8.8417 ns | 13.326 ns |
| Median | 546.81 ns | 547.28 ns | 547.65 ns |
| MAD | 1.4740 ns | 2.2699 ns | 2.8909 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.