Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is
c string
10 Articles
10
Substring in c programming – C Programming – c programming code to find a substring from a given string and for all substrings of a string.
C++ programming for Pattern Searching Set 7 Boyer Moore Algorithm – Bad Character Heuristic – Searching and Sorting – When we do search for a string in file.
C programming for Pattern Searching Set 7 Boyer Moore Algorithm(Bad Character Heuristic) – Searching and Sorting – search is problem in computer science.
PYTHON programming for Searching for Patterns Set 3 Rabin – Karp Algorithm – Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search.
C++ Programming-Searching for Patterns Set 1 Naive Pattern Searching – Searching and Sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[].
C Programming-Searching for Patterns Set 1 Naive Pattern Searching – Searching and Sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[].
PYHTON Programming-Searching for Patterns Set 1 Naive Pattern Searching – Searching and Sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[].
TERNARY SEARCH – searching and sorting algorithm – The ternary search does less number of comparisons as it makes Log3n recursive calls, but binary search.
How to make cut/copy/paste in GVim on Ubuntu work with Ctrl+X,Ctrl+C,Ctrl+V – It is commented very well and if some command