0

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.

captonssj
  • 301
  • 8
  • 22

3 Answers3

1

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

jason
  • 236,483
  • 35
  • 423
  • 525
0

Consider

Introduction to Algorithms

enter image description here

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

Amir Afghani
  • 37,814
  • 16
  • 84
  • 124
  • He said run space, not run time. I don't really like that book, so I could be wrong, but I don't think it talks about run space complexity at all. – jason Mar 10 '11 at 20:25
  • I've never heard of space complexity being separately treated from runtime complexity - but I could be wrong. The Leaf book is considered the gold standard for this kind of stuff though... – Amir Afghani Mar 10 '11 at 21:16
  • It's true that you don't talk about space complexity without talking about time complexity, but it's perfectly possible to talk about time complexity without talking about space complexity. I think that is the case with this book (I don't have a copy to check; I ditched mine a long time ago. I think CLRS is highly overrated.) – jason Mar 11 '11 at 01:21
0

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.

Jerry
  • 1