We analyse the complexity of a simple algorithm for computing asymptotic solutions of algebraic differential equations. This analysis is based on a computation of the number of possible asymptotic monomials of a certain order, and on the study of the growth of this number as the order of the equation grows.