Algorithmic Complexity + Asymptotic Notations

Hi all,

I've been trying to study algorithmic complexity/asymptotic notations from a long time now. I've searched a lot of tutorials on the internet dealing with the subject, but none of them gave me a clear picture/understanding of the subject.
Currently I'm studying the topic from the book:
"Introduction to algorithms"
------Thomas H.Cormen
------Charles E. Leiserson
------Ronald L. Rivest
------Clifford Stein

I'll be highly grateful if anyone could point me to some good tutorials/books from where I should/could study the topic.

Thanks in anticipation.

Most of the stuff you'll find is dipped in a college math text and run through an arrogant mathematician's brain. This is a layman's introduction to asymptotic notation from the perspective of the average programmer.

And this is an arrogant mathematician's explanation of asymptotic notation from the perspective that the reader would want to know exactly what asymptotic notation says.

So what we have is here are examples of catering to the arrogant computer geek ("I can't really understand college mathematics so it must be worthless") and to the arrogant mathematician ("It is correct so it doesn't matter if laymen understand it").

Both views have their utility, and both views suffer by automatically disregarding the value offered by the other.

But I don't think Prelude has the attitude that she can't understand college mathematics, and I don't have the attitude that it doesn't matter if laymen understand it.

Quote:

---

Originally Posted by Rashakil Fol

But I don't think Prelude has the attitude that she can't understand college mathematics, and I don't have the attitude that it doesn't matter if laymen understand it.

---

I didn't imply that you or Julienne had such an attitude. The links in this tread cater for both sides, and there is a need for both because of arrogance coupled with ignorance on both sides of the fence.