Clik here to view.
•Making change problem using Greedy method
The greedy approach is easy to understand and implement as well.We start with using the largest denomination coin. Once the owed amount is less than the largest, we move to next largest coin, so...
View ArticleClik here to view.
Minimum spanning tree
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and...
View ArticleClik here to view.
Job sequencing with deadlines
The sequencing of jobs on a single processor with deadline constraints is named as job sequencing with deadlinesProblemYou are given a set of jobs where each job has a defined deadline and some profit...
View ArticleClik here to view.
Rabin-Karp , The String Matching Algorithm.
Rabin-Karp , The String Matching Algorithm.The problem represents that: The TEXT is given and the Pattern is given and one need to find out that whether that Pattern is a subset of Text or we can say...
View ArticleClik here to view.
Time Complexity of Algorithms
For any defined problem, there can be N number of solution. And we have to decide which solution is the best based on the circumstances. Similarly for any problem which must be solved using a program,...
View ArticleClik here to view.
Longest Common Subsequence
Finding the longest sequence which exists in both the given strings.We are given two strings: string X of length n, and string Y of length m. Our goal is to produce their longest common subsequence:...
View ArticleClik here to view.
Change-making problem : Dynamic method
Change-making problem : Dynamic methodThe change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a...
View ArticleClik here to view.
This article is so helpful to understand about graph and its traversing...
This article is so helpful to understand about graph and its traversing technique
View ArticleClik here to view.
Knapsack Problem
1/0 knapsack solve using greedy methodThe knapsack problem is an example of a computational optimization problem, a topic in mathematics and computer science about finding the optimal object among a...
View ArticleClik here to view.
Master Theorem
Solve Recurrence Relation Using Master Theorem / MethodNot all the recurrences can be solved using the Master Theorem, but it still solves a large family of recurrences.To solve a recurrence relation...
View Article