Posted because this feature in particular sounded cool:

GB also packs functionality for complexity analysis.

Although, it’s a little different from what I thought. I was imagining you give it a function and a range of input sizes, and it returns one of O(1), O(log n), O(n), O(n log n) … etc, whichever seems to fit best. Instead it looks like you have to tell it “this is O(n log n)” and it tells you which constant factor fits that curve best. But it does also tell you the (root-mean-square) error, so I guess you’d use this to check how well it fits the curve you expect.

score 2 · canonical