Reputation: 311
Is there any materials I can read on run space analysis of an algorithm +O, +Theta , +Omega etc ? Need help for a Data Structures and Algorithm class I am taking.
Upvotes: 0
Views: 135
Reputation: 1
Its the gold standard but the puedocode approach it uses to decribe the algorithms is dated. Most indiviuals are better able to understand simple C or javascript type statements than the puedocode approach that the book uses.
Upvotes: 0
Reputation: 38541
Consider
It's what most computer science undergraduates have to read inorder to understand runtime complexity theory.
Upvotes: 0
Reputation: 241701
Check out chapter eight of Michael Sipser, Introduction to the Theory of Computation. A great chapter from a great book.
Upvotes: 1