冒泡排序啊

#include
int main()
{
	int arr[] = { 45, 65, 98, 23, 45, 65, 98, 32, 88};
	int i, j,n;
	int geshu = sizeof(arr) / sizeof(arr[0]);
	printf("排序前n");
	for (i = 0; i < geshu; i++)
	{
		printf("%d  ",arr[i]);
	}
	printf("n");
	for (i = 0; i < geshu-1; i++)
	{
		for (j = 0; j < geshu - i-1; j++)
		{
			if (arr[j]>arr[j + 1])
			{
				n = arr[j];
				arr[j] = arr[j + 1];
				arr[j+ 1] = n;
			}
		}
	}
	printf("排序后n");
	for (i = 0; i < geshu ; i++)
	{
		printf("%d  ", arr[i]);
	}


}