描述
输入十个整数,将十个整数按升序排列输出,并且奇数在前,偶数在后。
输入
输入十个整数
输出
按照奇偶排序好的十个整数
#include<iostream>
using namespace std;
int main()
{
int a[10];
for (int i = 0; i < 10; i++)
{
cin >> a[i];
}
//首先,把奇数放在数组的左边,偶数放在数组右边
int l = 0, r = 9;//用左右分别指向数组两端
while (l <= r)
{
bool leftIsOdd = a[l] % 2 == 1;
bool rightIsEven = a[r] % 2 == 0;
if (leftIsOdd)
{
l++;
}
else if (rightIsEven)
{
r--;
}
else if (!leftIsOdd &&!rightIsEven)//交换
{
int temp = a[l];
a[l] = a[r];
a[r] = temp;
}
}
//对l左边(奇数部分)冒泡,不断比较相邻的两个数,如果顺序错了,那么就交换
int start = 0, end = l;
for (int i = start; l < end - 1; i++)
{
for (int j = start + 1; j < start + end - l; j++)
{
if (a[j - 1]>a[j])
{
int temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
}
//对偶数部分冒泡,不断比较相邻的两个数,如果顺序错了,那么就交换
start = l, end = 10;
for (int i = start; i < end - i; i++)
{
for (int j = start + 1; j < start + end - i; j++)
{
if (a[j - 1]>a[j])
{
int temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
}
for (int i = 0; i < 10; i++)
{
cout << a[i] << endl;
}
system("pause");
return 0;
}
另一种方法:
#include<iostream>
using namespace std;
int main()
{
int a[10];
for (int i = 0; i < 10; i++)
{
cin >> a[i];
}
//冒泡,不断比较相邻的两个数,如果顺序错了,那么就交换
for (int i = 0; i < 9; i++)
{
for (int j = 1; j < 10 - i; j++)
{
//通过比较数字的大小决定顺序
//如果左边的为偶数,右边的为奇数,那么顺序也需要颠倒
bool leftIsEven = a[j - 1] % 2 == 0;
bool rightIsEven = a[j] % 2 == 0;
if ((leftIsEven&&!rightIsEven) || (leftIsEven == rightIsEven &&a[j - 1] > a[j]))
{
int temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
}
for (int i = 0; i < 10; i++)
{
cout << a[i] << " ";
}
system("pause");
return 0;
}