A Mixed-Evolutionary Statistical Analysis of an Algorithm's Complexity

C. Cotta, P. Moscato

Applied Mathematics Letters 16(1):41-47, 2003

© Elsevier Science 2003. All rights reserved.


This paper introduces the Evolutionary Analysis of Algorithms. A combination of evolutionary algorithms and statistical techniques is used to analyze the worst-case computational complexity of two sorting algorithms. It is shown that excellent bounds for these algorithms can be obtained using this approach; this fact raises interesting prospects for applying the approach to other problems and algorithms. Several guidelines for extending this work are included.

Download BibTEX entry
Electronic version available from ScienceDirect
Preprint version (96 KB)
[Back to publications page].