Runspace Analysis

Is there any materials I can read on run space analysis of an al开发者_JAVA百科gorithm +O, +Theta , +Omega etc ? Need help for a Data Structures and Algorithm class I am taking.

Check out chapter eight of Michael Sipser, Introduction to the Theory of Computation. A great chapter from a great book.

Consider

Introduction to Algorithms

It's what most computer science undergraduates have to read inorder to understand runtime complexity theory.

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.