选择排序

#include <stdio.h>

void myswap(int *a,int i,int j)
{
	int temp = a[i];
	a[i] = a[j];
	a[j] = temp;
}

void mysort(int *a,int len)
{
	int i;
	for (i = 1;i < len;i++)
	{
		int get = a[i];
		int j = i - 1;
		
		while (get < a[j] && j >= 0)
		{
			a[j+1] = a[j];
			//myswap(a,j,j+1);
			j--;
		}
		a[j+1] = get;
		
	}
	
}

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

int main()
{
	int a[] = {3,1,4,5,8,0,9,6,7,2};
	int len = sizeof (a)/sizeof (int);
	
	mysort(a,len);
	myprint(a,len);
	
	return 0;
}