The paper studies the complexity of an algorithm that stratifies semialgebraic sets. It gives a general theorem on the complexity of an algorithm which constructs a stratification for a wide class of conditions, called here admissible. The algorithm is doubly exponential in the depth of the stratification. Usual conditions of regularity like Whitney conditions (a) and (b) or Bekka condition (C) are admissible.