C語言算法錦集(六) 數(shù)組常用操作

1、數(shù)組常用算法：查找：/*線性查找*/int find(int num,int x,int key) int i,m=-1; for(i=0;i<num;i+) if(xi=key) m=i; break; return m;/*折半查找*/int find(int x,int num,int key) int m=-1,low=0,high=num-1,mid; while(low<=high) mid=(low+high)/2; if(xmid=key) m=mid; break; else if(xmid>key) high=mid-1; else low=mid+1;

2、return m;/*折半查找（遞歸）*/int b_search(int x ,int low,int high,int key) int mid; mid=(low+high)/2; if(xmid=key) return mid; if(low>=high) return -1; else if(key<xmid) return b_search(x,low,mid-1,key); else return b_search(x,mid+1,high,key); /*尋找子串*/int find(char *s1,char *s2) int i,k=0; while(s1i=s

3、2i) i+; if(s2i=0) return k; s1+; k+; return -1;分詞：/*方法一*/void fen(char s10,char str) int i,j,k; for(i=0,j=0,k=0;stri!=0;i+) if(isalpha(ai) sjk+=stri; else sjk=0; k=0; j+; /*方法二*/#include<stdio.h>#include<string.h>void main() int i=0,n=0;char s80,*p; strcpy(s,"It is a book."); f

4、or(p=s;p!='0'p+) if(*p='') i=0; else if(i=0) n+;i=1; printf("%dn",n); getch();排序：/*插入法排序*/void sort(int a,int n) int i,j,t; for(i=1;i<n;i+) t=ai; for(j=i-1;j>=0&&t<aj;j-) aj+1=aj; aj=t; /*歸并排序*/#define x 10#define y 10void com(int *a,int *b,int *c) int i,j,

5、k; for(i=0,j=0,k=0;i<=x&&j<=y;) if(ai<bj) ck+=ai;i+; else ck+=bj;j+; if(i<x) for(k=k-1;i<x;i+) ck+=ai; if(j<x) for(k=k-1;j<y;j+) ck+=aj;/*交換法排序1 冒泡排序*/void sort(int a,int n) int i,j,t,flag; for(i=0;i<n-1;i+) flag=1; for(j=0;j<n-1-i;j+) if(aj>aj+1) t=aj; aj=aj+1; aj+1=t; flag=0; if(flag) break; /*交換法排序2*/void sort(int a,int n) int i,j,t; for(i=0;i<n-1;i+) for(j=i+1;j<n;j+) if(ai>aj) t=ai; ai=aj; aj=t; /*選擇法排序*/void sort(int a,int n) int i,j,point,t; for(i=0;i<n-1;i+) point=