c语言-冒泡排序法

#include 

void Fa(int a[], int s);

int main()
{
	int sz = 0, m = 0;
	int arr[10] = { 1, 3, 5, 7, 9, 10, 8, 6, 4, 2 };
	sz = sizeof(arr) / sizeof(arr[0]);
	Fa(arr, sz);
	for (m = 0; m < 10; m++)
	{
		printf("%d ", arr[m]);
	}
	return 0;
}

void Fa(int a[], int s)
{
	int i = 0, j = 0, t = 0;
	for (i = 0; i < s - 1; i++)
	{
		for (j = 0; j < s - 1 - i; j++)
		{
			if (a[j] > a[j + 1])        //若按逆序输出，把">"改成"<"
			{
				t = a[j];
				a[j] = a[j + 1];
				a[j + 1] = t;
			}
		}
	}
}