奇数和偶数分开排序

void move(int arr[], int sz)
{
	int lift = 0;
	int right = sz - 1;
	while (lift<right)
	{
		//打印左边是奇数
		while ( (lift<right) && arr[lift] % 2 == 1)
		{
			lift++;
		}
		//打印右边，是偶数
		while ( (lift<right) && arr[right] % 2 == 0)
		{
			right--;
		}
	//交换
		if (lift < right)
		{
			int tmp = arr[lift];
			arr[lift] = arr[right];
			arr[right] = tmp;
		}
	}
}
//打印这个数组
void print(int arr[], int sz)
{
	int i = 0;
	for (i = 0; i < sz; i++)
	{
		printf("%d\n", arr[i]);
	}
	printf("\n");
}
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	move(arr,sz);
	print(arr, sz);
	return 0;
}