fibonacci_recursive/our/32
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 3.4680 µs | 3.4726 µs | 3.4803 µs |
| Throughput | 9.1947 Melem/s | 9.2150 Melem/s | 9.2272 Melem/s |
| R² | 0.9916948 | 0.9919308 | 0.9912660 |
| Mean | 3.4660 µs | 3.4700 µs | 3.4755 µs |
| Std. Dev. | 9.0186 ns | 24.702 ns | 38.854 ns |
| Median | 3.4654 µs | 3.4671 µs | 3.4688 µs |
| MAD | 6.1188 ns | 8.0823 ns | 9.8678 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.