Most of the times the confusing fact is whether to go for an exhaustive search (dynamic programming or back tracking or brute force) to solve the problem or to go for the greedy approach.
I am not talking about using greedy to determine the best possible solution, I am talking about using greedy algorithm to find "the solution". I am trying to get some standard ways in which I can validate if the problem can be solved with greedy approach. Like Optimal substructure, memorization for dynamic programming. And not related any specific problem.
Are there any proof of induction I can do to decide if greedy approach will always produce the best solution?