期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2014
卷号：69
期号：1
出版社：Journal of Theoretical and Applied
摘要：The fundamental problem encountered in all applications of computer science, can be classifiedintothe area of searching, merging and sorting. In the analysis of large class of algorithms, we have to discuss the solution of general recurrences based on divide and conquer algorithms. Graph algorithms are studied on the building block heap and disjoint data structure. We investigate the complexity of both time and space in the implementation of these algorithms. Results are expressed in terms of functions of number of steps along with the data structure. We give in this paper the different expressions for these complexity arguments appearingas solutions of specific types of difference equation expressions.
关键词：Second Order Difference Equations; Forward Difference; Asymptotic And Oscillatory Behaviors; Algorithms;Complexity; Numerical Data.
