On the asymptotic behavior of some Algorithms
Data Structures and Algorithms
2007-05-23 v1 Classical Analysis and ODEs
Probability
Abstract
A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis techniques as it is usually done in this context. A new explicit representation of periodic functions involved is obtained at the same time.
Cite
@article{arxiv.cs/0502014,
title = {On the asymptotic behavior of some Algorithms},
author = {Philippe Robert},
journal= {arXiv preprint arXiv:cs/0502014},
year = {2007}
}
Comments
November 2004