Binary Search Tree - 1000 Elements
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.1952 ms | 1.2054 ms | 1.2210 ms |
| R² | 0.8317406 | 0.8390602 | 0.8225460 |
| Mean | 1.1968 ms | 1.2024 ms | 1.2095 ms |
| Std. Dev. | 16.223 us | 32.768 us | 48.112 us |
| Median | 1.1906 ms | 1.1922 ms | 1.1942 ms |
| MAD | 5.9413 us | 8.8180 us | 11.490 us |
Understanding this report:
The plot on the left displays the average time per iteration for this benchmark. The shaded region shows the estimated probabilty 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.