Question

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

Answer 1

You can find good answers in the following books:

• http://www.algorist.com/
• “Art of computer programming”, Knuth

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