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.