剑指offor面试题14：调整数组顺序使奇数位于偶数前面

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
using namespace std;


bool isEven(int n)
{
	return (n & 1) == 0;
}
void Reorder(int* pData, unsigned int length,bool(*func)(int))
{
	if (pData == NULL || length <= 0)
	{
		return;
	}

	int* pBegin = pData;
	int* pEnd = pData + length - 1;

	while (pBegin < pEnd)
	{
		while (pBegin < pEnd && !isEven(*pBegin))//找偶数
		{
			pBegin++;
		}
		while (pEnd > pBegin && isEven(*pEnd))//找奇数
		{
			pEnd--;
		}
		if (pEnd>pBegin)
		{
			int t;
			t = *pBegin;
			*pBegin = *pEnd;
			*pEnd = t;
		}
	}
}

void ReorderOddEven(int* pData,unsigned int length)
{
	Reorder(pData, length,isEven);
}
void main()
{
	int a[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	unsigned int length = sizeof(a) / sizeof(a[0]);

	ReorderOddEven(a, length);

	for (auto i : a)
	{
		cout << i;
	}
	cout << endl;

}