Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

I need a good book which starts from quite beginner to learn about calculating the complexity of Algorithm??

share|improve this question

closed as primarily opinion-based by Gilles Jun 8 '14 at 23:51

Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.

The classic textbook is CLRS (a.k.a "Cormen") –  Shaull Feb 24 '13 at 6:39
The Art of Computer Programming by Donald Knuth. –  saadtaame Feb 24 '13 at 22:48

1 Answer 1

The Aho, Hopcroft Ullman book "Design and analysis of computer algorithms" is a classic, Sedgewick's "Algorithms" should be very good (I haven't seen the recent 4th edition, though). A veritable encyclopaedia is Cormen, Leiserson, Rivest and Stein's "Introduction to algorithms". For a more advanced, mathematical view, Sedgewick and Flajolet's "An introduction to the analysis of algorithms" is very useful.

You could also look at Open Courseware or Coursera for an introductory algorithms course, or in general trawl the web for lecture notes.

share|improve this answer

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