Energy Analysis Method of Computational Complexity

Abstract

Energy analysis method of computational complexity is proposed. Entropy and quantum superposition theory are used to calculate the problem¿s lower bound of energy consumption. Energy consumption and computational complexity are direct ratio. The computational complexity is decided only by initial state and final state of problem. The algorithm¿s details are needless in this method. Energy analysis method reflects the physics essences of the problem. It is a very simple method to calculate the lower bound of problem¿s complexity. The lower bound of search problem and sort problem are calculated by this method. The lower bound of search problem is logn and the lower bound of sort problem is nlogn. The results are accord with the facts well.