0-1 Knapsack Problem in C Using Dynamic Programming Here you will learn about 0-1 knapsack problem in C. We are given n items with some weights and corresponding values and a knapsack of capacity W. The items s...Learn More

Bellman-Ford Algorithm in C and C++ Here you will learn about Bellman-Ford Algorithm in C and C++. Dijkstra and Bellman-Ford Algorithms used to find out single source shortest paths. i.e. there is a source...Learn More

Matrix Chain Multiplication in C and C++ Here you will learn about Matrix Chain Multiplication with example and also get a program that implements matrix chain multiplication in C and C++. Before going to ...Learn More

Travelling Salesman Problem in C and C++ Here you will learn about Travelling Salesman Problem (TSP) with example and also get a program that implements Travelling Salesman Problem in C and C++. Let say th...Learn More

C Program for Longest Common Subsequence Problem In this post I am sharing C program for Longest Common Subsequence Problem. LCS problem is a dynamic programming approach in which we find the longest subseq...Learn More