What is the best resource online/text for learning and doing time complexity problems

Hi guys,
            What is the best resource for learning time complexity in algorithms apart from wikipedia
and introduction to algorithms?
sriramvemarajuAsked:
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

d-glitchCommented:
This textbook is quite comprehensive:

     http://mitpress.mit.edu/catalog/item/default.asp?tid=8570&ttype=2

They use it at MIT.  One of the co-authors (Rivest) is the R in RSA.
phoffric\Commented:
But the book "Introduction to Algorithms, Second Edition" as noted in the first post. But watch the class video lectures:
     http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/

I would download all videos in case they disappear someday (that happened to me in another course). You can then playback at higher speeds (using VLC), and skip around to important parts.

Notice the nice feature that for each video, there is a verbatim transcript of what is spoken. This is useful if you are taking notes; now you can copy the text into your notes and modify as desired.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
sriramvemarajuAuthor Commented:
i already knew about introduction to algorithms book but its a little difficult for my standard but anyways i will try the video lecture series. Thank you.
phoffric\Commented:
>> best resource
Be careful what you wish for. I would say that this book is extremely challenging if you read it from cover to cover. The lectures do help to read the book; and the book helps the lectures.

The only better sources are research papers, which are sometimes purposely made obscure to keep you from understaning everything, but clear enough to continue getting recognition and grants.

But, given your comment that its a little difficult for your standard, I think you should try other resources first.

Are you familiar with "algorithms in java" by sedgewick? It also has recurrence equations to determine the complexity. And when I read Sedgewick a long time ago, the algorithms are explained with quite a bit more detail. I believe I came across an online version.

The Stanford CS II course is a C++ course (where they assume you already know some of the basics)
   http://www.academicearth.org/courses/programming-abstractions

It introduces complexity very gently throughout the course, more as a side bar. There are also library routines that you can download to actually see graphically the differences between the different sorts.
Here is the more complete homepage for this course. If you have trouble finding the graphical library and demos, then if and when I fix my broken computer, I'll be happy to upload it for you.
    http://www.stanford.edu/class/cs106b/
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Algorithms

From novice to tech pro — start learning today.