Definition
Algorithm Complexity
We base our considerations on the asymptotic worst-case complexity of an algorithm, i.e., by means of a function
, such that for every problem instance of size , the answer can b computed in operations (runtime), or respectively by means of bits in memory (memory requirement).