Is there a method for automatic runtime analysis of algorithms?
No algorithm can decide whether a given algorithm ever halts or not, so in particular no algorithm can tightly analyze the complexity of a given algorithm.