在一个N个整数数组里面，有多个奇数和偶数，设计一个排序算法，令所

void swap(int &a,int &b)
{
    int tmp;
    tmp = a;
    a = b;
    b = tmp;
}

void sort (int N, int a[])
{
    int left = 0;
    int right = N -1;
    while (left < right)
    {
        while ((a[left]&1)==1 && (left<right)) left++;
        while ((a[right]&1)==0 && (left<right)) right--;
        if (left<right) {
            swap(a[left], a[right]);
            left++;
            right++;
        }
        
    }
}

https://www.cnblogs.com/wujinsen/p/4693555.html
https://www.cnblogs.com/AndyJee/p/4463102.html