I wonder if there is any automated method of determining the Big-O time complexity of any function (at least )?
If I am creating the O (N) functions versus O (NLG) function, then I think I can visually find out which one is;
Edit: I'm very happy to find out that a semi-automated solution, just thinking that there is no way to completely avoid manual analysis.
It seems that the thing you are asking for is the extension of the problem of Halting. I do not believe that such a thing is possible even in theory.
Just answering this question, "Is this line of code ever going?" It will be very difficult if it is not impossible in the normal case.
Edit to edit: Although the general case is rude, look for a partial solution here:
In addition, some said that hand-to-hand analysis is the only option, but I do not believe it is the right way to actually see it. Even when a person is added to the system / machine, a rude problem is still rude. On more reflection, I think the 99% solution may be possible, and it can do better or better work than humans.
Comments
Post a Comment