Algorithm
文章平均质量分 77
迷糊的佳佳
这个作者很懒,什么都没留下…
展开
-
KMP(Knuth、Morris和Partt) 线性时间字符串匹配算法
#include#include#includevoid GetNext(int *next,char *s2,int len2){ int j=-1; int i=0; next[0]=-1; while(i<len2-1) { if(j==-1||s2[i]==s2[原创 2013-01-21 18:48:24 · 403 阅读 · 0 评论 -
LCS(最长公共子序列)
#include#include#include#define LEFT_UP 1#define UP 2 #define LEFT 3void LcsLength(char *s1,char *s2,int len1,int len2,int *b,int *c){ int i; int j; for(i=0;i<len1;i++原创 2013-01-21 19:00:39 · 431 阅读 · 0 评论 -
heapsort/minheap/maxheap/堆排序/最大堆/最小堆
#include#include#includevoid exchange(int *array,int i1,int i2){ if(array[i1]!=array[i2]) { array[i1]=array[i1]^array[i2]; array[i2]=array[i1]^arra原创 2013-01-21 19:42:01 · 775 阅读 · 0 评论 -
希尔排序/shell sort
#include#includevoid shellsort(int array[],int len){ int dk; int i; int j; for(dk=len/2;dk>=1;dk/=2) { for(i=dk+1;i<=len;++i)原创 2013-01-21 20:10:38 · 470 阅读 · 0 评论 -
字符全排列
#include#includevoid exchange(char *p,char *q){ if(*p!=*q) { *p=*p^*q; *q=*p^*q; *p=*p^*q; }}void permutation(char *pstr,原创 2013-01-21 20:12:25 · 467 阅读 · 0 评论 -
QuickSort/快速排序/快排
#include #include #include #include void exchange(int *array,int i1,int i2){ int temp; temp=array[i1]; array[i1]=array[i2]; array[i2]=temp;}int partition(int *原创 2013-01-21 19:11:52 · 515 阅读 · 0 评论