> Also, keep an eye out for 'amortized' complexity. This does | яркие и красочные сны

> Also, keep an eye out for "amortized" complexity. This does have a legitimately rigorous definition, but for latency-bound paths it can practically amount to "O(whatever), except for the particular invocations that are far, far worse under unspecified conditions".

> I (sadly) have to resort to use "O(scary)" too often for my taste.
> /* This is O(scary), but seems quick enough in practice. */