输出的奇数从大到小排序,输出的偶数从小到大排序
// 奇数偶数排序.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define Maxsize 1000
void sort(vector<int>&a)
{
int temp = 0;
for (vector<int>::iterator i = a.begin(); i !=a.end(); i++)
{
for (vector<int>::iterator j = i; j != a.end(); j++)
{
if (*i>*j)
{
temp = *i;
*i = *j;
*j = temp;
}
}
}
}
void sortoushu(vector<int>&a)
{
int temp = 0;
for (vector<int>::iterator i = a.begin(); i !=a.end(); i++)
{
for (vector<int>::iterator j = i; j != a.end(); j++)
{
if (*i>*j)
{
temp = *i;
*i = *j;
*j = temp;
}
}
}
}
void sortjishu(vector<int>&a)
{
int temp = 0;
for (vector<int>::iterator i = a.begin(); i !=a.end(); i++)
{
for (vector<int>::iterator j = i; j != a.end(); j++)
{
if (*i<*j)
{
temp = *i;
*i = *j;
*j = temp;
}
}
}
}
vector<int>shuru;
vector<int>oushu;
vector<int>jishu;
int main()
{
int test[Maxsize] = {0};
int num;
int count = 0; // use basic input
while ( cin >> num )
{
shuru.push_back(num);
test[count] = num;
++count;
if ( getchar() == '\n' )
break;
}
//for(vector<int>::iterator index = shuru.begin();index != shuru.end();++index)
//{
//cout << *index<<' ';
//}
//string xx;
//getline(cin,xx);
//cout << xx ;
for( int temp = 0;temp < count;++temp )
{
if(test[temp]%2==0)
{
oushu.push_back( test[temp] );
}
else if(test[temp]%2==1)
{
jishu.push_back( test[temp] );
}
}
sortjishu(jishu);
sortoushu(oushu);
for (vector<int>::iterator oddIndex = jishu.begin(); oddIndex != jishu.end(); ++oddIndex)
{
cout << *oddIndex << " ";//奇数
}
//cout << endl;
for (vector<int>::iterator evenIndex = oushu.begin(); evenIndex != oushu.end(); ++evenIndex)
{
cout << *evenIndex << " ";///偶数
}
//cout << endl;
//system("pause");
return 0;
}