C++ programming for Searching for Patterns Set 2 KMP Algorithm – Searching and sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1].
Algorithm
C++ Programming-Backtracking Set 3 (N Queen Problem) – Backtracking – We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and Set 2 respectively.
C Programming-Backtracking Set 3 (N Queen Problem) – Backtracking – We have discussed Knight’s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solved using Backtracking.
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.
Java programming for Searching for Patterns Set 2 KMP Algorithm – Searching and sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1].
C programming for Searching for Patterns Set 2 KMP Algorithm – Searching and sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1].
JAVA Programming for Write a program to print all permutations of a given string – Mathematical Algorithms – A permutation also called “arrangement number”
C++ Programming for Aho-Corasick Algorithm for Pattern Searching – Searching and sorting – Aho-Corasick Algorithm finds all words in O(n + m + z) time.
C Programming – Babylonian method for square root – Mathematical Algorithms – If we are sure that n is a perfect square, then we can use following method.
C Programming-program to add two numbers in base 14 – Mathematical algorithms – Just add the numbers in base 14 in same way we add in base 10.