算法实现数组前半部分为奇数，后半部分为偶数。

#include <iostream>

using namespace std;


void p(int a[], int n)
{
    int *p,*q;
    int tmp;

    p= a;
    q = a+n-1;

    while(p<q)
    {
        while(p<q && *p%2==1)
            p++;
        while(p<q && *q%2==0)
            q--;
        if (p<q)
        {
            tmp = *p;
            *p =*q;
            *q = tmp;
        }
    }
}


int main()
{
    int a[] = {1,2,4,7,3,5,4,5,3,1,7,8,6,6,9,2}; 

    p(a ,16);

    for (int i=0; i<16; ++i)
    {
        cout<< a[i]<<" ";
    }

    cout<<endl;

    return 0;
}