How can one decide even before written in actual code from an English algorithm, what complexity type it is?
Rules:
(Apart from exponentiation) all arithmetic operations have constant-complexity.
There are a fixed number of instructions, these don't rely upon input values.
All assignment operations and return statements have constant-complexity.
Constant Complexity M269
How can one decide even before written in actual code from an English algorithm, what complexity type it is?
Rules:
(Apart from exponentiation) all arithmetic operations have constant-complexity.
There are a fixed number of instructions, these don't rely upon input values.
All assignment operations and return statements have constant-complexity.