[Sankozi]

You are commenting under blog post that tried to explain it and got it wrong. It is not simple.

Examples:

- algorithm with O(2^n) complexity might be faster for your problem than O(1) algorithm

- the same algorithm may be O(2^n) or O(n³) depending how you define size function

This is not straightforward.

[fxwin]

that's why he said it describes how runtime behaves as input size changes, not how it behaves for specific values

[bongodongobob]

It is though.