include<iostream>
using namespace std;
void reorderodd_even(int *a, unsigned int length,bool (*p)(int))//12345
{
if (a == NULL || length == 0){
return;
}
int *pBegin = a;
int *pEnd = a + length-1;
while (pBegin < pEnd){
while (pBegin < pEnd && !p(*pBegin)){ //(*pBegin % 2 == 1
++pBegin;
}
while (pBegin < pEnd && p(*pEnd)){ //(*pEnd % 2 == 0)
--pEnd;
}
if (pBegin < pEnd)
{
*pBegin = (*pBegin) ^ (*pEnd);
*pEnd = (*pBegin) ^ (*pEnd);
*pBegin = (*pEnd) ^ (*pBegin);
}
}
}
bool isEven(int n)
{
return (n & 0x01) == 0;//偶数true。奇数false
}
int main()
{
bool (*p)(int);
int a[]={1,2,3,4,5,6,7,8,9};
unsigned int length = sizeof(a)/sizeof(a[0]);
p = isEven;
reorderodd_even(a,length, p);
for (int i = 0; i < length; i++)
{
cout << a[i] << " ";
}
cout << endl;
return 0;
}
承接上衣博文,如数组区分大小,区分被某个数整除的,等等
可扩展性的解法,利用函数指针去解决类似的问题