My understand of KMP describe in C

来源：互联网发布：知彼网络编辑：程序博客网时间：2024/05/23 12:55

FIRST:KMP--abstract
It's a algorithm improving from sample matching algorithm (BF algorithm).
It's detail description can view in WIKI from below:
    http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm

SECOND:the coding in Cpp
        below code is from github!!
   the kmp.h file

点击(此处)折叠或打开

/*******************************************************************************
* ALGORITHM IMPLEMENTAIONS
*
* /\ | _ _ ._ o _|_ |_ ._ _ _
* /--\ | (_| (_) | | |_ | | | | | _>
* _|
*
* KNUTH-MORRIS-PRATT ALGORITHMS
*
* Features:
* Complexity is O(n + k), where n is the target string length,
* and k is the pattern length
*
* http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm
*
******************************************************************************/
#ifndef __KMP_H__
#define __KMP_H__
#include <string.h>
namespace alg {
static void kmp_table(const char *W, int * T, int len);
/**
* S -> the text to be searched
* W -> the word to search
* return the position where W is found S
*/
static int kmp_search(const char * S, const char * W) {
int LEN_S = strlen(S);
int LEN_W = strlen(W);
int m = 0;
int i = 0;
int T[LEN_W];
kmp_table(W,T, LEN_W);
while (m+i < LEN_S) {
if (W[i] == S[m+i]) {
if (i == LEN_W -1) {
return m;
}
i++;
} else {
m = m+i-T[i];
if (T[i] > -1) {
i = T[i];
} else {
i = 0;
}
}
}
return -1;
}
/**
* build a table for the word to be searched
* eg:
* i 0 1 2 3 4 5 6
* W[i] A B C D A B D
* T[i] -1 0 0 0 0 1 2
*/
static void kmp_table(const char *W, int * T, int len) {
int pos = 2; // the current position we are computing in T
int cnd = 0; // the next character of the current candidate substring
T[0] = -1;
T[1] = 0;
while (pos < len) {
// first case: the substring continues
if (W[pos-1] == W[cnd]) {
cnd++;
T[pos] = cnd;
pos++;
} else if (cnd >0) { // second case: it doesn't, but we can fall back
cnd = T[cnd];
} else { // third case: we have run out of candidates. Note cnd = 0
T[pos] = 0;
pos++;
}
}
}
}
#endif //

the test demo kmp_demo.cpp

点击(此处)折叠或打开

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "kmp.h"
using namespace alg;
int main(void)
{
srand(time(NULL));
char * S = (char*)malloc(1001);
char * W = (char*)malloc(5);
memset(S,0, 1001);
memset(W,0, 5);
// random genrate a pattern for A, G, C,T
const char P[] = {'A', 'G','C','T'};
for (int i=0;i<1000;i++) {
int k = rand()%4;
S[i] = P[k];
}
for (int i=0;i<4;i++) {
int k = rand()%4;
W[i] = P[k];
}
// do a search for W from S
int pos = kmp_search(S, W);
printf("to be searched:%s\n", W);
if (pos > 0) {
printf("found in pos:%d\n", pos);
printf("text:\n%.*s", pos, S);
printf("\033[31m%s\033[0m", W);
printf("%s\n",&S[pos + strlen(W)]);
}
}

阅读(35) | 评论(0) | 转发(0) |

上一篇：My understand of stack and queue

下一篇：My first CXX problem:"aggregate has incomplete type and cannot be defined"

相关热门文章

test123
编写安全代码——小心有符号数...
使用openssl api进行加密解密...
一段自己打印自己的c程序...
sql relay的c++接口

linux dhcp peizhi roc
关于Unix文件的软链接
求教这个命令什么意思，我是新...
sed -e "/grep/d" 是什么意思...
谁能够帮我解决LINUX 2.6 10...

给主人留下些什么吧！~~

评论热议

0 0

知彼网络

原创粉丝点击