奇偶交换排序（作业

#define _CRT_SECURE_NO_WARNINGS
#include
#include
#define Max 99

//odd奇数 even number偶数

void Numorder(int* arr,int x)
{
	int i = 0;
	int tmp = 0;
	int rem = 1;
	while (rem != 0)
	{
		rem = 0;
		for (i = 0; i  arr[i + 1])
			{
				tmp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
				rem++;
			}
			i++;
		}
		for (i = 1; i  arr[i + 1])
			{
				tmp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
				rem++;
			}
			i++;
		}
	}
}

int m服务器托管网ain()
{
	int arr[Max] = { 0 };
	int i = 0;
	int x = 0;//输入x个数字
	printf("请输入要排序的数字个数：n");
	scanf("%d", &x);
	printf("请输入要排序的数字：n");
	for (i = 0; i  arr[i + 1])
			{
				tmp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
				rem++;
			}
			i++;
	服务器托管网	}
		for (i = 1; i  arr[i + 1])
			{
				tmp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
				rem++;
			}
			i++;
		}
	}*/

	for (i = 0; i