Greedy Algorithm in DAA
Greedy Algorithm ek problem-solving technique hai jo har step par locally best choice select karti hai. DAA mein iska use optimization problems jaise Fractional Knapsack, Activity Selection, Huffman Coding aur MST mein hota hai.