|Table of Contents|

Analyzing the T ime Complexity of Recursion A lgorithm by Applying Generation Function Theory(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2005年01期
Page:
92-94
Research Field:
Publishing date:

Info

Title:
Analyzing the T ime Complexity of Recursion A lgorithm by Applying Generation Function Theory
Author(s):
FANG X ianjin;  PAN Dilin;  GUAN Jianjun
tim e com plex ity, recursion, genera tion function
Keywords:
-
PACS:
-
DOI:
-
Abstract:
Ana lyz ing the time comp lex ity of one a lgo rithm is very important to the ana ly sis of and research on the a l-go rithm. It is usua lly difficu lt to ana lyze the tim e com plex ity o f a recursiv e a lgor ithm. In th is paper, the theo ries o f g eneration function and recursive relation in com bina to rics is used to ana ly ze the tim e com plex ity of som e specia l re-cursive algorithm, w ith three conc lusions reached s imu ltaneously, w hich is of v aluable re ference to the ana lys is and research on a lgo rithm.

References:

[ 1] 严蔚敏, 吴伟民. 数据结构[M ]. 北京: 清华大学出版社, 1991. 303 -305.
[ 2] 谭浩强. C 程序设计[M ] . 第2版. 北京: 清华大学出版社, 2003. 160- 163.
[ 3] 黄国瑜, 叶乃箐. 数据结构( C 语言版) [M ] . 北京: 清华大学出版社, 2001. 13 -18.
[ 4] 卢开澄. 组合数学[M ]. 北京: 清华大学出版社, 2000. 48- 79.
[ 5] 杨骅飞, 王朝瑞. 组合数学及其应用[M ] . 北京: 北京理工大学出版社, 1992. 40- 48.

Memo

Memo:
-
Last Update: 2013-04-29