选择排序

include<stdio.h>

include<stdlib.h>

include<time.h>

void sort2(int* q);

int main()
{
int a[10],*q,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");

q = &a[0];

sort2(q);

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

}

void sort2(int* q)//选择排序
{
int i, j, k, t;
for (i = 0; i < 10; i++) {
t = i;
for (j = i + 1; j < 10; j++)
{
if (*(q + t) > * (q + j))
t = j;
}
k = *(q + i);
*(q + i) = *(q + t);
*(q + t) = k;
}

}