Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lecture -18 Dynamic Programming

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
65,036
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Aug 27, 2008

Lecture Series on Design & Analysis of Algorithms by Prof.Abhiram Ranade, Prof.Sunder Vishwanathan , Department of Computer Science Engineering,IIT Bombay. For more details on NPTEL visit http://nptel.iitm.ac.in

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • This is the first sane description of dynamic programming I've seen. Thank you very much Prof Ranade.  I've struggled with this subject for years.

  • superb lecture.

see all

All Comments (72)

Sign In or Sign Up now to post a comment!
  • 23:15

    

  • RuntimeError: maximum recursion depth exceeded wut?

  • These videos are awesome!!!!!!!!

  • very good lecture but u think it will be better if doctor complete tree

    actually that what i do to understand

    thanks at all

  • I can't believe dynamic programming is simply backtracking with memory, and that this eliminates so many branches.

  • Thank you, this is very useful.

  • This was seriously the most succinct and clearest explanation of dynamic programming I have ever seen. I wish I would've seen this years ago in university.

  • Great lecture! What's the name of the prof.?

  • Excellent exposition. Thanks!

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more