一、字符串
bf算法
int BF(char S[ ], char T[ ])
int i=0,j=0;
while (S[i] !='\0'&&T[j]!= '\0'){
if(S[i] == T[j]){
i++;j++;
}
else{
i=i-j+1; j= 0;
}}
if(T[i]—- '\0') return (i-j+1);
else return 0;
}
kmp算法
https://www.bilibili.com/video/BV1jb411V78H?from=search&seid=12945602620444796754
二、稀疏矩阵
三元组的顺序表存储
#define MaxTerm 100
typedef struct
{
Element data[MaxTerm];
int mu,nu, tu;
}SparseMatrix;
十字链表存储
typedef struct OrthNode
{
Element data;
struct OrthNode *right, *down;
}OrthNode;