|
|
|
|
|
|
by mattmerr
1223 days ago
|
|
|
The variance in the 10^i number generation graphs stands out to me. Is number generation really so periodic in performance? I've seen bumpy graphs from O(log2) algorithms recursing additional times near each power of two, for example. For the last two graphs, is the x-axis "each run"? Maybe there's a better chart for this than a line chart, as you're really trying to show distributions, not the correlation between run # and time. (if the experiments are independent you could rearrange the order of the runs and the meaning shouldn't change) |
|
|