# What is meant by "complexity"?

r-ba opened this issue · comments

Our goal is to compare the length and "complexity" of the same code in many different languages. Which language is the best? Now we can know.

What is meant here by the "complexity" of code, and is it something that is well defined?

Maybe is referred to as a complex algorithm, that is defined as what fast or slow of a particular task of an algorithm performs.

Amount of time or space required by an algorithm (usually input of given size of (n))

@sayantan3 I'm aware of the theoretical definition. Each addition to this repository is an implementation of the same algorithm. The complexity of any algorithm is measured mathematically, which in and of itself has nothing to do with the language it's implemented in, the compiler used, or the architecture of the machine it's run on.

The point is that the term "complexity" as used in the readme is loosely defined, and meaningless at worst.