EGAVE

complexity function

Meaning

  1. noun A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols; a function that counts the number of words of a given length.
  2. noun A function representing the computational complexity an algorithm.

Similar words

analysis of algorithms time complexity constant-recursive sequence recursive language formal language lexical analysis list analysis of parallel algorithms longest palindromic substring integer complexity

Save “complexity function” to learn later