冒泡排序

include<stdio.h>

include<stdlib.h>

include<time.h>

void sort1(int* p);

int main()
{
int a[10],* p,i, n;
srand(time(0));
for (i = 0; i < 10; i++)
{
a[i] = rand() % 100;
}

printf("a~before---");
for (n = 0; n < 10; n++)
{
	printf("%2d ", a[n]);
}printf("\n");

p = &a[0];
    sort1(p);
printf("a~later---");
for (n = 0; n < 10; n++)
{
	printf("%2d ", a[n]);
}printf("\n");

return 0;

}
void sort1(int* p)//冒泡排序
{
int i,t, n;

for(i=1;i<10;i++)
	for(n=0;n<10-i;n++)
		if (*(p + n) > * (p + n + 1)) {
			t = *(p + n);
			*(p + n) = *(p + n + 1);
			*(p + n + 1) = t;
		}

}