Lecture -10 Greedy Algorithms -I

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
32,026
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

  • It makes me sad seeing him so thin :(

  • Man these lecture series ROCK! Best explanation for the intuition behind things!

see all

All Comments (22)

Sign In or Sign Up now to post a comment!
  • If we consider the K copies to be single entity (since we can pick only one among them and there is nothing that distinguishes them w.r.t to problem) and then apply the minimum number of overlap technique , it will still work . Is there any other example to show minimum

    overlap doesnt work? 

  • haters gonna hate

  • @Pingu123489 stfu

  • Pick intervals with less overlap!!! me screaming that at 34:00 nice lecture

  • Stop making vids, go eat!

  • @SideofClouds I hope it also makes you sad when seeing corpulent parents with corpulent kids visiting Fast Food Restaurants. Of course they enjoy living ;)

  • one of the best courses during my stint. This is one video to bookmark :)

  • lecturer seems not be well prepared..he sucks in the way of explanation..Need to have some good english communication skills.Indians always suck in explanation..

  • Does he live near Fukishima

  • @SideofClouds That is coz he is greedy 4r analysis and design of algo.

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