# Difference between time complexity and computational complexity [duplicate]

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.

## migrated from stackoverflow.comMay 4 '15 at 18:02

This question came from our site for professional and enthusiast programmers.

• Please do not post the same question on multiple sites. Each community should have an honest shot at answering without anybody's time being wasted. If you don't get a satisfying answer after a week or so, feel free to flag for migration. – D.W. May 2 '15 at 7:44
• @D. W. I will respect that next time :-) – Median Hilal May 2 '15 at 9:34

• You haven't used the term various other resourceswhich are helpful in computation! So, a downvote. Please visit my answer. It is not used as a key factor to compare algorithms, it's for the whole program and the resources used to perform those computation, like memory,parallel threads,etc. – Am_I_Helpful May 2 '15 at 5:30
• @shekharsuman More reasons? I don´t understand this particular line at all, and why it is mathematical with it´s : and :: . The wikipedia quote is unnecessary and time complexity [is] to identify the complexity of execution of algorithm doesn´t answer anything because it clear to everyone, and the rest of the sentence makes it sound like time and computational compl. are completely different things – deviantfan May 2 '15 at 6:26