## Knapsack Problem explained

The knapsack problem is one of the oldest problems that has been in the study for a century and the earliest reference to this problem dates back to 1897. The …

## Greedy Algorithm

The greedy algorithm is simple and very intuitive and is very successful in solving optimization and minimization problems. The greedy algorithm makes the optimal choice in each step of the …

## Traveling Salesman Problem

The traveling salesman problem is one of the difficult algorithms and it is because there is no clear solution that exists, and many experts and researchers have given their solution …

## Activity Selection Problem

Greedy Algorithm are known for creating the optimum solution of the problem. Greedy Algorithm are best when the solution that we are trying to achieve has no definite best solution, …

## Master Theorem and Examples

When we analyze the loop we find many times it calls in the recursion, and many of the algorithm are recursive in nature. On the analysis of the algorithm we …

## Recursion Tree Method

There are lot of time when the recurrence occurs in our program in our sorting algorithm for example in merge sort we divide the algorithm into sub problem and then …