山谷序列C语言,重温经典排序思想--C语言常用排序全解(转载--值得一看)

void select_sort(int *x, int n)

{

int i, j, min, t;

for (i=0; i

{

min = i;

for (j=i+1;

j

{

if (*(x+j)

< *(x+min))

{ min = j;

}

} if (min != i)

{

t =

*(x+i);

*(x+i) =

*(x+min);

*(x+min) =

t;

}

}

}

void insert_sort(int *x, int n)

{

int i, j, t;

for (i=1; i

{

t=*(x+i);

for (j=i-1;

j>=0 &&

t

{

*(x+j+1) =

*(x+j);

}

*(x+j+1) = t;

}

}

void bubble_sort(int *x, int n)

{

int j, k, h, t;

for (h=n-1; h>0; h=k)

{

for (j=0, k=0;

j

{

if (*(x+j)

> *(x+j+1))

{

t = *(x+j);

*(x+j) = *(x+j+1);

*(x+j+1) = t;

k = j;

}

}

}

}

void shell_sort(int *x, int n)

{

int h, j, k, t;

for (h=n/2; h>0; h=h/2)

{

for (j=h; j

j++)

{

t =

*(x+j);

for (k=j-h;

(k>=0 &&

t

{

*(x+k+h) = *(x+k);

}

*(x+k+h) =

t;

}

}

}

void quick_sort(int *x, int low, int high)

{

int i, j, t;

if (low < high)

{

i = low;

j = high;

t = *(x+low);

while

(i

{

while

(i

*(x+j)>t)

{

j--;

}

if

(i

{

*(x+i) = *(x+j);

i++;

}

while

(i

*(x+i)<=t)

{

i++;

}

if

(i

{

*(x+j) = *(x+i);

j--;

}

}

*(x+i) = t;

quick_sort(x,low,i-1); quick_sort(x,i+1,high); }

}

void sift(int *x, int n, int s)

{

int t, k, j;

t = *(x+s);

k = s; j = 2*k + 1;

while (j

{

if (j

&& *(x+j) <

*(x+j+1))

{

j++;

}

if

(t

{

*(x+k) =

*(x+j);

k = j;

j = 2*k +

1;

}

else

{

break;

}

}

*(x+k) = t;

}

void heap_sort(int *x, int n)

{

int i, k, t;

int *p;

for (i=n/2-1; i>=0; i--)

{

sift(x,n,i);

}

for (k=n-1; k>=1; k--)

{

t = *(x+0);

*(x+0) = *(x+k);

*(x+k) = t;

sift(x,k,0);

}

}

void main()

{

#define MAX 4

int *p, i, a[MAX];

p = a;

printf("Input %d number for sorting :\n",MAX);

for (i=0; i

{

scanf("%d",p++);

}

printf("\n");

p = a;

select_sort(p,MAX);

for (p=a, i=0; i

{

printf("%d ",*p++);

}

printf("\n");

system("pause");

}