This question already has an answer here:

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.


marked as duplicate by Raphael May 4 '15 at 18:21

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

migrated from stackoverflow.com May 4 '15 at 18:02

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

  • 4
    $\begingroup$ 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. $\endgroup$ – D.W. May 2 '15 at 7:44
  • 1
    $\begingroup$ @D. W. I will respect that next time :-) $\endgroup$ – Median Hilal May 2 '15 at 9:34

Computational complexity is the general subject of using complexity measures to compare programs or algorithms. Time complexity and space complexity are two measures that are commonly used when talking about computational complexity, but there are others.

For example, it's common to look at the number of comparisons performed in a sorting algorithm.

  • $\begingroup$ 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. $\endgroup$ – Am_I_Helpful May 2 '15 at 5:30
  • 2
    $\begingroup$ @shekharsuman Sorry, but I find both your comment and your answer hard to understand. $\endgroup$ – Paul Hankin May 2 '15 at 5:42
  • $\begingroup$ @Anonymous- I am really sorry that you couldn't get my point,but,please go through the Wikipedia link that I have referred in my answer! Really sorry not to make you understand. $\endgroup$ – Am_I_Helpful May 2 '15 at 5:47
  • 2
    $\begingroup$ @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 $\endgroup$ – deviantfan May 2 '15 at 6:26
  • 4
    $\begingroup$ @shekharsuman a) Calm down, it´s pointless to argue. b) I don´t see a ratio (like % numbers) anywhere and it wouldn´t make sense; same for proportions. c) Thanks, but I know what complexity means without Wikipedia. d) The link to Wikipedia doesn´t make your answer good. $\endgroup$ – deviantfan May 2 '15 at 6:39

Not the answer you're looking for? Browse other questions tagged or ask your own question.