Landau (ide) Notation Support Tools

It is a good idea to have unidentified information during development, as Landau's designation, in order to know the time spent on functions. Therefore, it should be documented in the sources, right?

I am looking for tools that can calculate it.

+3
source share
1 answer

In the general case, the asymptotic complexity of an arbitrary algorithm is unsolvable, according to Riesz's theorem .

, (, ), . ( , . , JITed, , Java, , , , .)

+3

Source: https://habr.com/ru/post/1742875/


All Articles