Preview lessons, content and tests

Computer Science & Programming solved. All in one platform.

1. To trial the platform and take tests, please take a few seconds to SIGN UP and SET UP FREE.
2. Searching for something specific? See our text overview of all tests. Scroll right for levels, and lists.

Join 36000+ teachers and students using TTIO.

Recap on Big O

The most time consuming part in an Evolutionary Algorithm(EA) is the Fitness Function. If you need to evaluate the time complexity of EAs (evolutionary algorithms) with Big O notation, you can use O(NG), where N describe the size of population and G stands for number of iterations.

So what is the time complexity of a GA? The anwser to your question will usually depend on (in order of significance):

  • 1. The fitness function
  • 2. The selection operator
  • 3. The variation operators

If the number of generations and population size is constant, as long as your mutation function, crossover function, and fitness function takes a known amount of time, the big o is O(1) - it takes a constant amount of time.

Suggested Video (Recap)