divide and conquer

DAA Algorithm The word algorithm has been derived from the Persian author’s name, Abu Ja ‘far Mohammed ibn Musa al Khowarizmi (c.…

Traveling Salesperson problem using branch and bound Given the vertices, the problem here is that we have to travel each vertex exactly…

Kruskal Algorithm The Kruskal Algorithm is used to find the minimum cost of a spanning tree. A spanning tree is a connected…

Recurrence Relation A recurrence is an equation or inequality that describes a function in terms of its values on smaller inputs. To…

Differentiate between Dynamic Programming and Greedy Method Dynamic Programming Greedy Method 1. Dynamic Programming is used to obtain the optimal solution. 1.…

Recursive Maze Algorithm Recursive Maze Algorithm is one of the best examples for backtracking algorithms. Recursive Maze Algorithm is one of the…

NP-Completeness A decision problem L is NP-Hard if L’ ≤p L for all L’ ϵ NP. Definition: L is NP-complete if L…

Vertex Cover Vertex Cover Definition Vertex Cover ≤ρ Clique Clique ≤ρ Vertex Cover Vertex Cover ϵ NP 1) Vertex Cover: Definition: –…

Shortest Common Supersequence The shortest common supersequence is the variation of the longest common subsequence. Problem Statement: Given two strings s1 and…

Dynamic Programming Dynamic programming is a technique that breaks the problems into sub-problems, and saves the result for future purposes so that…