Non%20Recursive%20Algorithms

1
Non Recursive Algorithms (Section
2.3)
2
Summations
?i1,n(qi)
denotes q1 q2 qn
Thus, the formula for the average complexity can
be expressed as
(?i1,N t(casei))/N Where N cases
3
Some Summation Formulas
(See Appendix A)
?i1,n(C vi )
C ?i1,n(vi )
?i1,n(qi vi )
?i1,n(qi) ?i1,n(vi )
?i1,n(qi vi )
?i1,n(qi) ?i1,n(vi )
?i0,(N-C)(i C)
?iC,n(i )
4
Some Summation Formulas (2)
?i1,n(i)
n(n1)/2
?i1,n(i2)
n(n1)(2n1)/6
?i1,n(2i)
2(n1) - 1
?i1,n(Ai)
(A(n1) 1)/(A 1)