Simple Explanation And Implementation Of Knuth-Morris-Pratt (KMP) Algorithm For String Search

Introduction We have seen brute force approach to string search here. Brute force approach to string search has time complexity of O(n*m). Donald Knuth and Vaughan Pratt, and James H. Morris conceived the algorithm in 1970. KMP algorithm is the first algorithm to have linear time complexity. Problem Statement We will assume text (where we... Continue Reading →

Depth First Search In Python to print nodes of Graph

Graph Shown above is a simple graph. Let's define the characteristic of the graph: This is a connected graph. Meaning, you can travel from anywhere to anywhere in this graph.  Read further here This is an undirected graph. That simply means we don't have any direction sense to the arrow connecting two nodes This is... Continue Reading →

Up ↑