简单选择排序

#include
#include

void display(int * a, int n) 
{   
	assert(a);
	for(int i = 0; i < n; i++)
	{
		printf("%d,",a[i]);
	}
	printf("\n");
}

void swap(int * a, int * b)
{   
	assert(a);
	assert(b);
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}

void select_sort(int * a, int n)
{  
	assert(a);
	int i, j,min;
	for( i = 0; i < n-1  ; i++) //i 0 ~ n-2
	{
		min = a[i]; //每次选择一个作为最小值
	
		for( j = i; j < n; j++) // j i ~ n-1
		{
			if(a[j] < min)
			{
			   swap(&(a[j]), &(a[i]));  
			}
		}
	}
}

int main()
{   
	int a[10] ={2, 1, 3, 4, 5, 7,2,3, 6, 1};
	int num = sizeof(a)/sizeof(int);
	printf("before_sort:");
	display(a, num);
	select_sort(a,num);
	printf("after_sort:");
	display(a, num);
	return 0;
	
}

#include 
#include 

//交换两个数据
void swap(int *a, int *b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}


//显示交换后的数组
void display_array( int a[], int n )
{
    int i;
    for( i = 0; i < n; i++ )
        printf( "%d ", a[i] );
}



//选择排序
void select_sort( int a[], int n )
{

	int i ,j;
	
	for(i = 0; i