使用任意一种排序算法对输入序列进行排序,将其中元素数值域为单数进行升序排序和元素数值域为偶数的按照降序排序
#include <iostream>
using namespace std;
#define MAX_SIZE 100
typedef int KeyType;
typedef int ElemType;
typedef struct {
KeyType key;
ElemType data;
} SqType;
// 补充以下快速排序函数代码,使得输入参数desc为0时实现升序,desc为1时实现降序
void QuickSort(SqType R[], int s, int t, int desc)
{
int i = t, j = s,q=desc;
SqType tmp;
if (s < t) {
tmp=R[s];
if(q==0)
{
while(i!=j)
{
while(j>i&&R[j].key>=tmp.key)
j--;
R[i]=R[j];
while(i<j&&R[i].key<=tmp.key)
i++;
R[j]=R[i];
}}
if(q==1)
{
while(i!=j)
{
while(i<j&&R[j].key<=tmp.key)
j--;
R[i]=R[j];
while(i<j&&R[i].key>=tmp.key)
i++;
R[j]=R[i];
}}
R[i]=tmp;
// 在此处补充你的代码
QuickSort(R, s, i - 1, desc);
QuickSort(R, i + 1, t, desc);
}
}
int main()
{
SqType a[MAX_SIZE];
SqType b[MAX_SIZE];
int n = 0, an = 0, bn = 0, m;
cin >> n;
for (int i=0; i<n; i++) {
cin >> m;
if (m % 2 == 0) {
a[an].key = a[an].data = m;
an++;
} else {
b[bn].key = b[bn].data = m;
bn++;
}
}
QuickSort(b, 0, bn - 1, 0);
QuickSort(a, 0, an - 1, 1);
for (int i=0; i<bn; i++) {
cout << b[i].key << " ";
}
for (int i=0; i<an; i++) {
cout << a[i].key << " ";
}
return 0;
}