Suping Wu
Abstract
In this paper,using the examples,based on generation function method to solve the problems of analysis of time complexity in complicated recurrence algorithm and the transform recurrence algorithm into efficient algorithm.On this condition,efficient combination algorithm can be designed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,using the examples,based on generation function method to solve the problems of analysis of time complexity in complicated recurrence algorithm and the transform recurrence algorithm into efficient algorithm.On this condition,efficient combination algorithm can be designed.
Key concepts: Algorithm, Algorithm design, Computer science, Dinic's algorithm, Ramer–Douglas–Peucker algorithm, Freivalds' algorithm, Dijkstra's algorithm, Theoretical computer science