初夏小谈：奇偶排队，杨氏矩阵（查找数字）大O阶小于(N)

1.调整数组使奇数全部都位于偶数前面。

#include<Aventador_SQ.h>
#define ROW 100
void JiOuSort(int arr[ROW],int count)
{
	int count1 = 0;
	int i = 0,j=0;
	int temp = 0;
	for (i = 0; i < count; i++)
	{
		if (arr[i] % 2 == 1)
		{
			count1++;
		}
	}
	for (i = 0; i < count1; i++)
	{
		if (arr[i] % 2 == 0)
		{
			for (j = count1; j < count; j++)
			{
				if (arr[j] % 2 == 1)
				{
					temp = arr[i];
					arr[i] = arr[j];
					arr[j] = temp;
					break;
				}
			}
		}
	}
	for (int i = 0; i < count; i++)
	{
		printf("%d ", arr[i]);
	}
}

int main()
{
	int i = 0;
	int arr[] = { 2,4,6,8,10,1,3,5,7,9 };
	int count = sizeof(arr) / sizeof(arr[0]);
	JiOuSort(arr,count);
	system("pause");
	return 0;
}#include<Aventador