# Tag Archives: DSA

## Depth First Search(DFS)- DSA

Graph and Trees are two similar like Data structures with some difference, and Depth First Search is a traversing or searching algorithm that can apply to both the structures. The DFS algorithm was investigated by Charles Pierre Trémaux back in the 19th century. Here in this article, we have covered the DFS (Depth First Search) algorithm for Graph… Read More »

## DSA – Dynamic Programming

In Divide an Conquer algorithms we use independent operations on sub-parts of a program, and we only store the final result, but in dynamic programming, the operation on one sub-part of the program depend on each other. In dynamic programming, we usually store the result of all the different sub-programs so we could use it later in the… Read More »

## DSA – Divide and Conquer

Divide and conquer is an Algorithm paradigm which we use to solve the big data problems. As by its name itself divide and conquer, this algorithm divides a huge problem into sub-parts and then try to solve the specific subpart to get the solution. We often use the recursion statements in Divide and Conquer algorithms, the divide and… Read More »

## DSA – Greedy Algorithms

To solve a problem, we use that algorithm which provides more efficiency and takes less time to run the program, in short, we try to get the optimal solution for a given problem. Greedy Algorithm is a concept or pattern that we follow to design an algorithm. In Greedy Algorithms, we build a solution piece by piece and… Read More »