常考算法总结.docx

常考算法总结

第一篇：常考算法总结-------------------------voidinsertsort(intlist[],intn)//直接插入排序{inti,j,temp;for(i=1;ifor(j=i-1;j>=0;j--)if(templist[j+1]=list[j];elsebreak;list[j+1]=temp;}}-------------------------voidincrsort(intlist[],intn,inth)//shell排序{inti,j,temp;for(i=h;ifor(j=i-h;j>=0;j-=h)if(templist[j+h]=list[j];elsebreak;list[j+h]=temp;}}voidshellsort(intlist[],intn)//shell排序{inti,incr=n;do{incr=incr/3+1;for(i=0;iincrsort(list,n,incr);}while(incr>1);}-------------------------voidbubblesort(intlist[],intn)//冒泡排序{inti,j,temp;for(i=0;ifor(j=i+1;j{if(list[i]>list[j]){temp=list[i];list[i]=list[j];list[j]=temp;}}}-------------------------voidswap2(int&a,int&b)//引用传值{inttemp;temp=a;a=b;b=temp;}voidswap1(inta,intb)//值传值{inttemp;temp=a;a=b;b=temp;}voidswap(int*a,int*b)//指针传值{inttemp;temp=*a;*a=*b;*b=temp;}intpartition(intlist[],intlow,inthigh)//快速排序{inti=low+1,j=high,temp1;temp1=list[low];do{while(temp1>list[i])i++;while(temp1if(i{swap(&list[i],&list[j]);}}while(iswap(&list[low],&list[j]);returnj;}voidquicksort(intlist[],intlow,inthigh)//快速排序{intk;if(lowk=partition(list,low,high);quicksort(list,low,k-1);quicksort(list,k+1,high);}}-------------------------voidmerge(intlist[],int*temp,inta,intb,intc,intd,int*k)//两路归并过程{inti=a,j=b;while((i{temp[(*k)++]=list[j++];}}while(ivoidmergesort(intlist[],intn)//归并排序{int*temp=(int*)malloc(sizeof(int)*100);inta,b,c,d,i,k,h=1;while(ha=0;k=0;while(a+h{c=a+h;b=c-1;if(c+h-1>n-1)d=n-1;elsed=c+h-1;merge(list,temp,a,b,c,d,&k);a=d+1;}for(i=0;i{list[i]=temp[i];}h*=2;}}-------------------------voidselectsort(intlist[],intn)//简单选择排序{inti,j,small;for(i=0;ismall=i;for(j=i+1;jif(list[j]small=j;swap(&list[i],&list[small]);}}-------------------------char*nizhi(char*str)//字符串逆置{char*p=str;intlen=strlen(str);inti,j;chartemp;for(i=0,j=len-1;i*(p+len)='';returnp;}-------------------------intx,y;//判断回文数voidjudge(int*data,intlen)//判断是否回文{inti,j,f=0;for(i=0,j=len-1;ivoidseparate(int*data,intn)//将数字个十位分开存入data{intj,k,t;y=0;while(n!=0){*(data+y)=n%10;n=n/10;y++;}*(data