In this article, I will explain What is Kruskal’s Algorithm and How Does it Work. Kruskal’s algorithm is a greedy algorithm used to find the minimum spanning tree of a weighted, undirected graph. It works by initially sorting all the edges in the graph by their weights, and then adding edges to the minimum spanning tree in increasing order of […]
In this article, What is Prim’s Algorithm and Does it Work. Prim’s algorithm is a greedy algorithm used to find the minimum spanning tree of a weighted, undirected graph. It works by selecting a starting vertex and growing the minimum spanning tree from this vertex by repeatedly adding the adjacent edge with the minimum weight that connects the tree to […]
In this article, I will explain What is Dijkstra Algorithm and How Does it Work. Basically, Dijkstra’s algorithm is a greedy algorithm used to find the shortest path between a source vertex and all other vertices in a weighted graph. It works by initially assigning a tentative distance to each vertex in the graph, which is set to infinity for […]
In this article, I will explain What is Bellman-Ford Algorithm and How Does it Work. Bellman-Ford algorithm is a dynamic programming algorithm used to find the shortest path between a source vertex and all other vertices in a weighted graph, even when the graph contains negative weight edges. The algorithm works by initially setting the distance to the source vertex […]
In this article, I will explain What is Naive String Matching Algorithm and How Does it Work. The Naive String Matching algorithm is a simple algorithm used to find all occurrences of a pattern string in a text string. It works by comparing the pattern string with all substrings of the text string, starting from the first character of the […]
In this article, I will explain What is Rabin-Karp Algorithm and How Does it Work. The Rabin-Karp algorithm is a string matching algorithm that uses hashing to find all occurrences of a pattern string in a text string. The algorithm works by computing a hash value for the pattern string and for all substrings of the text string with the […]
In this article, I will explain What is Knuth Morris Pratt (KMP) Algorithm and How Does it Work. The Knuth-Morris-Pratt (KMP) algorithm is a string matching algorithm that finds all occurrences of a pattern string in a text string. The algorithm works by precomputing a partial match table, which contains the length of the longest proper prefix of the pattern […]
In this article, I will explain What is Huffman Coding Algorithm. Huffman coding algorithm is a lossless data compression algorithm that works by assigning variable-length codes to characters in a message. The codes are assigned in such a way that the most frequently occurring characters in the message are assigned the shortest codes, and the least frequently occurring characters are […]
In this article, I will explain how to Create Hashing Table Using Open Addressing. What is a Hash Table? Basically, a hash table is a data structure that stores keys and their associated values, and allows fast lookup, insertion, and deletion of key-value pairs. Open addressing is one technique for implementing a hash table, where collisions are resolved by finding […]
In this article, I will explain How to Perform Perfect Hashing. What is Perfect Hashing? Perfect hashing is a technique for creating a hash table with no collisions, meaning that each key is uniquely mapped to a single slot in the table. The following steps show how to perform perfect hashing. Performing Perfect Hashing Choose a hash function: A hash […]