题解 | 整数奇偶排序

#include<bits/stdc++.h>
using namespace std;

//快速排序
int devide(int num[],int l,int r)
{
    int mid = num[l];
    while(l<r)
    {
        while(num[r]>=mid&&l<r)r--;
        num[l] = num[r];
        while(num[l]<=mid&&l<r)l++;
        num[r] = num[l];
    }
    num[l] = mid;
    return l;
}

void quickSort(int num[],int l,int r)
{
    if(l>=r)return;
    int M = devide(num,l,r);
    quickSort(num,l,M-1);
    quickSort(num,M+1,r);
}

int main()
{
    int a[10],b[10],c[10];
    while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9])
    {
        int i = 0,j = 0;
        for(int k = 0;k<10;k++)
        {
            if(a[k]%2 == 0)
            {
                b[i++] = a[k];//偶数
            }
            else {
            c[j++] = a[k];//奇数
            }
        }
        quickSort(b,0,i-1);
        quickSort(c,0,j-1);

        int k = 0;
        for(int l = j-1;l>=0;l--)
        {
            a[k++] = c[l];
        }
        for(int l = 0;l<i;l++)
        {
            a[k++] = b[l];
        }
        for(int l = 0;l<10;l++)
        {
            cout<<a[l]<<" ";
        }
    }
    return 0;
}