选择冒泡插入排序

#include<stdio.h>
int mp(int a[],int n)//冒泡
{
	int i, j, t;
	for (i = 0; i < n - 1; i++)
	{
		for ( j = 0; j < n-i-1; j++)
		{
			if (a[j]>a[j + 1]){
				t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
		}
	}
}
int xz(int a[], int n)//选择
{
	int i, j, k,t;
	for ( i = 0; i < n-1; i++)
	{
		k = i;
		for ( j =i+1 ; j < 5; j++)
		{
			if (a[k]>a[j])k = j;
		}
		t = a[k], a[k] = a[i], a[i] = t;
	}
}
	
int cl(int a[], int n)//插入
{
	int i, j, m;
	for ( i = 1; i < n; i++)
	{
		m = a[i];
		j = i - 1;
		while (j >= 0 && m<a[j]){
			a[j + 1] = a[j];
			j--;
		}
		a[j + 1] = m;
	}
}
int main()
{
	int a[] = {54,12,64,13,4},i;
	//cl(a, 5);
	//mp(a,5);
	//xz(a,5);
	for ( i = 0; i < 5; i++)
	{
		printf("%d\t",a[i]);
	}

}