Difference between time complexity and computational complexity?

Question

For measuring the complexity of an algorithm, is it time complexity, or computational complexity? What is the difference between them?I used to calculate the maximum (worst) count of basic (most costing) operation in the algorithm.

Answer 1

There could be two important metrics: time and space. That is, "how many compute cycles are necessary to complete the algorithm" and "how much memory/secondary storage is necessary to complete the algorithm."

Each may be important in any particular context.

Please feel free to reach out for clarification