DSA - 0-1 Knapsack Problem DSA - Longest Common Sub-sequence Algorithm DSA - Travelling Salesman Problem (Dynamic Approach) Hashing DSA - Hashing Data Structure DSA - Collision In Hashing Disjoint Set DSA - Disjoint Set DSA - Path Compression And Union By Rank ...
The algorithm never reverses the earlier decision even if the choice is wrong. It works in a top-down approach. This algorithm may not produce the best result for all the problems. It's because it always goes for the local best choice to produce the global best result. However, we can ...