Assume, we have a complex algorithm consists of several operations that prevents you to even estimate the asymptotic time complexity. How I can get a rough number of operation (multiplication and add) or even somehow get a asymptotic analysis. the analysis can be even a not-very-bad estimation. In CNN, we can calculate FLOPs. But how we can calculate FLOPs for non-deep network? any method? any software?
I have read here But it is very simple and my algorithm is complex.
