Buzen's algorithm: Difference between revisions

Revision as of 20:00, 11 November 2006

Revision as of 17:27, 16 February 2007

Line 40:

This recursive relationship allows for the calculation of all <math>G(N)</math> up to any value of N in [[Big O notation|order]] <math>O(MN^2)</math> time.

There is a more efficentefficient algorithm for finding <math>G(N)</math> for some network. If it is assumed that <math>f_{i>1}( n ) = c_iy_i^n</math>, then the recursive relationship can be simplified as follows:

{|