10 comments

[ 3.6 ms ] story [ 43.2 ms ] thread
While I'm always suspicious of the word "Best" when applied to a list this does look quite interesting. Looks like a lot of the material overlaps but I'm guessing that's not a bad thing for complex material like this.
(comment deleted)
Not recorded lectures, but the 'best' book I've found lately for a good intro is [1]"Basic Concepts in Data Structures" by Shmuel Tomi Klein. It uses pseudocode so can be done in any language. Look at the preview table of contents. There's a cheaper paperback and Amazon has used copies.

Another good book is CMU's parallel data structures and algorithms course http://www.cs.cmu.edu/~15210/schedule.html which uses this [2]free book

[1]http://www.cambridge.org/ca/academic/subjects/computer-scien...

[2]http://www.parallel-algorithms-book.com/

If you don't mind dropping a few bucks on Coursera, Tim Roughgarden's algorithms sequence adopted from his Stanford lectures and MOOC are exceptional:

https://www.coursera.org/specializations/algorithms

Can't recommend enough. The material and instruction are top-notch.

They are actually available for free on the Stanford online course website.
Using the word "best" isn't always quite appropriate. I think it is better to mention, "Best for <whom>".
Any suggestions for kids (age 5-12) -- to teach just basic concepts?