how to calculate algorithm time complexity and space complexity

Question

hi friend, how to calculate algorithmic time complexity and space complexity,best to give some examples. thank.

Vulpes · Answer

Well, algorithm time complexity is usually measured using 'Big O' notation which shows how the amount of time needed to complete the operation varies as the size of the input data increases. Because of the complexity of some algorithms, it can be difficult to determine the appropriate 'Big O' level and so the results may not be exact. In contrast algorithm space complexity can be measured by the amount of memory in bytes which is needed to complete the operation as the size of the input data increases (not counting the size of the input data itself). In today's machines where memory is relatively plentiful, space complexity is often unimportant. As regards time complexity, I'd read through these articles which I've dug out: http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=complexity1 http://www.cs.utexas.edu/users/djimenez/utsa/cs1723/lecture2.html Space complexity can be determined by simply examining the variables and objects which the algorithm needs for various levels of input and summing the memory they occupy for whatever programming language you're using.

Ken H · Answer

thank

how to calculate algorithm time complexity and space complexity

Answers (2)