World Mentoring Academy "An Open Community for Successful Learning"

Free World class mobile education, earn a Bachelors for less than $5,000 books & Test Fees from State Universities, using Experiential, Design & Project based education. Supporting credit-by-exam & Challenging University courses.

Creative Commons License
Expand/collapse block About & Angel Club

Expand/collapse block Login
Keep me logged in
Expand/collapse block Selected courses
Expand/collapse block Information for lesson "Greedy algorithms"
Description: This lesson is an introduction to a family of hard problems. They need an enormous amount of computational power, for the best available solution. Also, there are heuristic alternatives that offer good, but often not "optimal" solutions. A greedy algorithm, follows the problem solving heuristic of making a locally optimal choice at each stage, finding a global optimum. In many problems, a greedy strategy does not, produce an optimal solution, nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution with in a reasonable time. #greedy #algorithms
Objectives: To get to know and experiment with several known algorithms
Assessment: A simple three questions test
Resources: This lesson uses extensive java based demonstrations. OpenCourseware from NPTEL (India), Sheridan College, MIT, UC Berkeley, Stanford & many other of the World's finest University's.
Language: English
Professors: Javier Thayer, Don Brooks, Michael Williams
Units: 13, Tests: 1
Lesson content
Enroll Enroll