greedy.py

#Greedy method

#This method is used for optimization problem

#It is used for the result if solution demands the minimum cost or maximum cost
#low cost more value(minimum cost)
#there can be more than one result but every solution has only one feasible solution

#####-----Strategies used for optimization problem-----######
#----------------Greedy Method
#----------------Dynamic Programming
#----------------Branch and Bound

#####-----GREEDY MEHTOD-----#####
# Algo Greedy(a,n):
#     for i in n:
#         x = select(a)
#         if feasible(x) then:
#             sol = x

#####-----JOB SEQUENCING PROBLEM-----######
#kii job complte ho in less time and more profit