The Research And Application Of Several Algorithm Design Patterns

Automatic programming has been a struggle target in the field of computer science. Algorithms are the soul of programs, the key of problem solution, the basis and difficulty of programming. The realization of automatic programming depends on the the realization of automation of algorithm design. Because algorithm design is creative labor, there are many difficulties in the realization of automatic programming.In the long-term practice about algorithm and program design, people have summarized some frequently-used and effective algorithm design methods: Greedy, Divide and Conquer, Dynamic Programming, Backtracking and Branch and Bound. Because many programs can be sovled by them, we expect extracting the commonness of each algorithm by lucubration about it and construct its algorithm design pattern by generic mechanism. When we want to solve a problem, its program can be generated by instantiation of its corresponding algorithm design pattern. It cannot only debase the difficulty of the program development, but also provide an effective approach for the research of automation of algorithm design.The main works in this paper include:1,Based on the research about Greedy, Divide and Conquer, Dynamic Programming, Backtracking, Branch and Bound, we abstract these five algorithms into algorithm design patterns. This is the keystone and difficulty of the research in this paper.2,Based on the five algorithm design patterns, the algorithm design templates are realized.3,The usage of the above algorithm design templates are shown by some typical problems.The practice proves that the algorithm design templates put forward here have better reusage. It can debase the difficulty of the program development and improve the efficiency of programming. Because these algorithm design templates have been tested by many examples, their reliability can be ensured and the reliability of programs based on them can be improved.