The inductive process is used to specify the evolution of algorithm in this paper. The relationship between a set of sentences of first-order language and an algorithm is established and inductive rules for heuristics are presented. A probabilistic approach to algorithm analysis is also presented. This approach provides a tool for design of efficient algorithm and automatic algorithm design.