排序方法总结

1.快速排序void QuickSort( int *list , int left , int right , int index ){int i , j , k ;int pivot ;int temp ;i = left ; j = right + 1 ; pivot = list[left] ;if( i < j ){do{do{i++ ;}while( list[i] <= pivot && i <= right ) ;do{j-- ;}while( list[j] >= pivot && j > left ) ;if( i < j ){temp = list[i] ;list[i] = list[j] ;list[j] = temp ;}}while( i < j ) ;temp = list[left] ;list[left] = list[j] ;list[j] = temp ;QuickSort( list , left , j - 1 , index ) ; //排序左半边QuickSort( list , j+1 , right , index ) ; //排序右半边}}void main(){int list[] = {1,2,0,9,8,7,6,5,4,3,2,1,5};int index = sizeof(list)/sizeof(int);int i;QuickSort( list , 0 , index - 1 , index ) ;for( i = 0 ; i < index ; i++){printf("%d " , list[i] ) ;}}#include<stdio.h>void Display(int [], int);void heapsort(int [],int );void creatheap(int [],int , int );void swap(int arr[], int i, int j);void main(){int a[] = {13,38,27,49,76,65,49,97};int len = sizeof(a)/sizeof(int);heapsort(a,len);Display(a,len);}void Display(int arr[], int len){int i;for(i=0; i<len; i++){printf("%d ",arr[i]);}printf("\n");}void heapsort(int arr[],int len){int i;int index = len-1;//创建大根堆第一次建堆for(i=(len-2)/2; i>=0; i--){creatheap(arr,i,len-1);}//交换和调整for(i = len-1; i>0; i--){swap(arr,i,0);creatheap(arr,0,i-1);} }void creatheap(int arr[],int root, int index) {int temp = arr[root];int j = root*2+1;while(j<=index){if(j<index){if(arr[j] < arr[j+1])j++;}if(arr[j] > temp){arr[(j-1)/2] = arr[j];j = j*2+1;}else{break;}}arr[(j-1)/2] = temp;}void swap(int arr[], int i, int j){int temp;temp = arr[i];arr[i] = arr[j];arr[j] = temp;}#include<stdio.h>void output(int a[],int n){int i;for(i=1;i<n;i++){printf("%3d",a[i]);}puts("");}void shellinsort(int a[],int len,int d) //d是记录间的距离{int i,j;for(i=1+d;i<len;i++){if(a[i]<a[i-d]){a[0]=a[i];for(j=i-d;j>0&&a[0]<a[j];j-=d){a[j+d]=a[j];}a[j+d]=a[0];}}}void shellsort(int a[],int len,int d[],int n)//len是数组a[]的长度,n是数组d[]的长度{int i;for(i=0;i<n;i++){//调用插入排序函数shellinsort(a,len,d[i]);}} void main(){int a[]={-1,46,55,13,42,94,17,05,70};int d[]={4,2,1};int len,n;len=sizeof(a)/sizeof(int);n=sizeof(d)/sizeof(int);output(a,len);puts("==========排序结果==========");shellsort(a,len,d,n);output(a,len);}4．归并排序#include<stdio.h>void msort(int *c,int*b,int m,int k,int n){int i,j,t=m;for (i=m,j=k+1;i<=k&&j<=n;++t){if(c[i]<c[j])b[t]=c[i++];else b[t]=c[j++];}while(i<=k)b[t++]=c[i++];while(j<=n)b[t++]=c[j++];}void merge(int *a ,int *b,int m,int n){int c[20];int k;if(m==n)b[m]=a[m];else{k=(m+n)/2;merge(a,c,m,k);merge(a,c,k+1,n);msort(c,b,m,k,n);}}void main(){int a[20]={1,2,3,9,8,7,6,5,12,32,34,64,15,34,21,3,4,8,6,20};int i;merge(a,a,0,20-1);for(i=0;i<20;i++){printf("%-8d",a[i]);}}5．二叉树的遍历#include <malloc.h>#include <stdio.h>#include <stdlib.h>typedef struct A{int data;struct A *lchild;struct A *rchild;}B;void Procreattree(B **T){int temp;scanf("%d",&temp);if( 0 == temp )(*T) = NULL;else{if(!((*T) = (B * )malloc(sizeof(B))) )exit(-1);else{(*T)->data = temp;Procreattree(& ((*T)->lchild));Procreattree(& ((*T)->rchild));}}}void ProTravetree(B * T){if(NULL != T){printf("%d\0",T->data);if(NULL != T->lchild){ProTravetree(T->lchild);}if(NULL != T->rchild){ProTravetree(T->rchild);}}}void MidTravetree(B * T){if(NULL != T){if(NULL != T->lchild){ProTravetree(T->lchild);}printf("%d\0",T->data);if(NULL != T->rchild){ProTravetree(T->rchild);}}}void LastTravetree(B * T){if(NULL != T){if(NULL != T->lchild){ProTravetree(T->lchild);}printf("%d\0",T->data);if(NULL != T->rchild){ProTravetree(T->rchild);}}}int main(){B *p;Procreattree(&p);ProTravetree(p);}。