Big O Notation – Using not-boring math to measure code’s efficiency
I have a question for those with a better understanding of such things. Is it difficult to calculate time or memory  complexity of a function through static analysis?It seems kind of basic, but I still find myself manually checking code instead of relying on a tool.