Font Size: a A A

The Application Research Of Recursive Technique In The Algorithm Design

Posted on:2013-07-02Degree:MasterType:Thesis
Country:ChinaCandidate:Y ZhangFull Text:PDF
GTID:2298330377459847Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Since algorithm is the core of computer science, its research is one of theimportant fields in computer study. Its reliability, correctness and efficiency have beenthe key issue, which is highly valued by scholars all over the world. Based onrecursive technology design, it gets the solution recursive relations throughmathematical transformation; it is the algorithm procedures to obtain the problems onthis basis.As the problem-solving recursive relations are made by the rigorousmathematical transformation, it can guarantee the correctness of the recursive relation,so as to ensure the correctness of the algorithm. Since the computation is supported bythe recursion relation, every step is based on the solution of former subproblem, sothat lots of repetitive computation can be avoided, by which algorithm program can bemore efficient, which can effectively improve the efficiency of the algorithmprocedure.In addition, after the development of many years, there has formed the fivetraditional algorithm design methods——the Partition method, the Greedy method,the Dynamic Programming method, Back method and Branch and Bound method.However, when algorithm designer is faced with a specific problem, there is nocertain rule to follow concerning which method to be adopted. With long-termresearch, we find algorithm design based on recursive technology can solve someproblems instead of some traditional algorithm design method, offering a generalapproach to the algorithm.The thesis is to1. Deeply study the solution strategies and features of traditional method ofalgorithm design;2. Explore the solution features and rules of algorithm design method based onthe recursion technique;3. Study the relation between the traditional algorithm design method and thenew one.In the thesis, the new method is explored deeply. Two solution strategies are putforward;meanwhile approaches supported by recursion technique to divide and conquer algorithm, greedy algorithm and dynamic programming algorithm are given attention which is a try for a relatively unified approach of algorithm design.
Keywords/Search Tags:the method of algorithm design, recursive technique, program statute, recurrence relation
PDF Full Text Request
Related items