Сложность генетического алгоритма

Мне надо оценить сложность генетического алгоритма. Вот мой псевдокод: population <- make_population()

for i = 0; i < generations; i++ : 

    fitness = compute_fitness() 

    fittest = minimal fitness     

    new_population.append(elities) 

    for population_size: 

        parent1 = selection(population) 

        parent2 = selection(population) 

        new_population.append(crossover(parent1, parent2)) 

    for population_size: 

        mutate(population) 

Return best solution