There is no guarantee that the study of algorithms will produce sums and recurrences with straightforward closed form solutions. In fact much of the adventure of analysis of algorithms lies in the variety of mathematics to which researchers are drawn (at times kicking and screaming) in their attempts to understand algorithms. Frequently the researchers will turn to asymptotic analysis.
KeywordsCentral Limit Theorem Asymptotic Analysis Integer Point Tauberian Theorem Bernoulli Polynomial
Unable to display preview. Download preview PDF.