International Journal of the Computer, the Internet and management 17.SP1 (March 2009)

Permanent URI for this collection

Now showing 1 - 1 of 1

Linear recurrence equation to analyzing the complexity of algorithms

( 2009) To, Tang Van

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.