Characteristics and Features of Problems solved by Greedy Algorithms

Posted By on October 20, 2014


Download PDF
Rabin-Karp model for string matching
Introduction to Greedy algorithm
To construct the solution in an optimal way. Algorithm maintains two sets. One contains chosen items and the other contains rejected items.
The greedy algorithm consists of four (4) function.
  1. A function that checks whether chosen set of items provide a solution.
  2. A function that checks the feasibility of a set.
  3. The selection function tells which of the candidates is the most promising.
  4. An objective function, which does not appear explicitly, gives the value of a solution.
Rabin-Karp model for string matching
Introduction to Greedy algorithm

Download PDF

Posted by Akash Kurup

Founder and C.E.O, World4Engineers Educationist and Entrepreneur by passion. Orator and blogger by hobby

Website: http://world4engineers.com