Your c++ series is one of the best... Nice example, short and clear. One query on this video..as it was mentioned that once solution found in greedy , it don't go ahead to find better solution. Does this mean that brute force is used to find optimization but greedy can never be used to find optimization?
@@CppNuts I feel that your explanation about greedy is not correct.. greedy algorithm is used for finding optimization solution right? such as maximisation problem or minimization problem
@@nageshpoojary271 It is correct, the greedy algorithm doesn't look back the code for optimization. and that is why it more efficient to code greedy algos easily :)
What is better approach than brute force? Is there a term/method for that algorithm with obvious name like brute force has an obvious name and can be searched easily..
