poddroid
poddroid

Reputation: 855

To compute the worst-case running time function of an algorithm what are the steps to be followed? Algorithms

To compute the worst-case running time function of an algorithm what are the steps to be followed? Please some one guide me in that. I think these steps includes some mathematical proof's. If I am correct In which parts of mathematics areas I should be strong? (I guess mathematical Induction,functions, sets are enough)

Thanks

Upvotes: 0

Views: 974

Answers (2)

Tony The Lion
Tony The Lion

Reputation: 63190

To learn about computational complexity you need to know Calculus, Combinatorics, Set Theory, Summations amongst other maths topics.

A good book; though fairly theoretical is Introduction To Algorithms by Cormen et. al.

Upvotes: 0

Elalfer
Elalfer

Reputation: 5338

You can find good answers in the following books:

I think mostly this is: good understanding of the algorithm, combinatorics and computational complexity theory - http://en.wikipedia.org/wiki/Computational_complexity_theory

Upvotes: 1

Related Questions