Design and Analysis of Algorithms
knapsack-problem
0-1-knapsack
fractional-knapsack
greedy-algorithm
dynamic-programming
daa
design-and-analysis-of-algorithms
optimization
np-complete
algorithms
Knapsack Problem in DAA: 0/1 & Fractional Knapsack Explained
Knapsack Problem DAA ka ek important optimization problem hai jisme limited capacity ke andar items select karke maximum value obtain ki jaati hai. Isme 0/1 Knapsack ke liye Dynamic Programming aur Fractional Knapsack ke liye Greedy Algorithm use hota hai.