An algorithmic formalization method based on recurrence technique

Algorithm design is the core of the programming. It is also the most difficult and most challenging work in the programming. The correctness of algorithm is the key problem in computer science all the way. Algorithmic formalization method is one of the effective ways to ensure the algorithmic correctness. The algorithmic formalization method based on recurrence technique obtains the recurrence relations by the strict mathematical transformation and then transforms them into the algorithm in order to ensure the correctness of the algorithm program. This paper introduces this method in detail and shows the algorithmic derivation process by the knapsack problem and quick sort problem.