lower bound theory

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…

Divide and Conquer Method vs Dynamic Programming Divide and Conquer Method Dynamic Programming 1.It deals (involves) three steps at each level of…

N-Queens Problem N – Queens problem is to place n – queens in such a manner on an n x n chessboard…

Merging Network Merging Network is the network that can join two sorted input sequences into one sorted output sequence. We adapt BITONIC-SORTER…

String Matching with Finite Automata The string-matching automaton is a very useful tool which is used in string matching algorithm. It examines…

Matrix Chain Multiplication It is a Method under Dynamic Programming in which previous output is taken as input for next. Here, Chain…

Dynamic programming vs Backtracking Before understanding the differences between dynamic programming and backtracking, we should know about dynamic programming and backtracking separately.…