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.
In the general case, the asymptotic complexity of an arbitrary algorithm is unsolvable, according to Riesz's theorem .
, (, ), . ( , . , JITed, , Java, , , , .)
Source: https://habr.com/ru/post/1742875/More articles:Передача списка и параметр типа словаря с помощью Python - pythonHow to change the connection string or other application settings during testing in Visual Studio 2008? - unit-testingIs this a variation of the traveling salesman problem? - stringFacebook Connect via Javascript does not close and does not pass the session identifier - javascriptnsfetchedresultscontroller с пустыми разделами - iphoneOne iPhone, two machines for developers - iphonejQuery UI: two semicolons after a logical expression using a function wrapper - javascriptlatex compact table of contents? - latexПроверка того, имеет ли RoutedEvent какие-либо обработчики - c#JUnit Test, если XML-документ сортируется по произвольному столбцу - xmlAll Articles