Linear recurrence equation to analyzing the complexity of algorithms
Linear recurrence equation to analyzing the complexity of algorithms
Published date
2009
Resource type
Publisher
ISBN
ISSN
DOI
Call no.
Other identifier(s)
Edition
Copyrighted date
Language
eng
File type
application/pdf
Extent
4 pages
Other title(s)
Authors
Advisor
Other Contributor(s)
Citation
International Journal of the Computer, the Internet and management 17.SP1 (March 2009), 17.1-17.4
Degree name
Degree level
Degree discipline
Degree department
Degree grantor
Abstract
Solving recurrence equation (Res) is an important technique in the analysis of algorithms. Especially for the divide and conquer algorithms, establishing the recurrence equations, solving them as well as finding the order of complexity will be discussed.