#include<iostream>
#include<string.h>
using namespace std;
int Sort(const int &iLen,int *NumBuffer)
{
int ilen = iLen;
int *iTempBuffer =new int[ilen];
int iTemp = 0;
for(int i =0; i < (ilen-1) ; i++)
{
for( int j = i + 1; j < ilen ; j++)
{
if(NumBuffer[i] > NumBuffer[j] )
{
iTemp = NumBuffer[i];
NumBuffer[i] = NumBuffer[j];
NumBuffer[j] = iTemp;
}
}
}
for(int i =0 ; i < ilen ; i++)
{
iTempBuffer[i] = NumBuffer[i];
}
int k = 0;
for(int i = 0; i < ilen; i++)
{
if(((iTempBuffer[i] % 2) != 0) &&( (k+1) % 2 != 0) )
{
NumBuffer[k++] = iTempBuffer[i];
}
else if(((iTempBuffer[i] % 2) == 0) &&( (k+1) % 2 == 0) )
{
NumBuffer[k++] = iTempBuffer[i];
}
else if(((iTempBuffer[i] % 2) != 0) && ( (k+1) % 2 == 0) )
{
NumBuffer[k++] = 0;
NumBuffer[k++] = iTempBuffer[i];
}
else if(((iTempBuffer[i] % 2) == 0) &&( (k+1) % 2 != 0) )
{
NumBuffer[k++] = 0;
NumBuffer[k++] = iTempBuffer[i];
}
}
NumBuffer[k] = '\0';
delete[] iTempBuffer;
return k;
}
int main()
{
int m[100] = {2,4,5,10,6,9,7,11,3,1};
int k = Sort(10,m);
for(int i =0;i<k;i++)
{
cout<<m[i]<<endl;
}
getchar();
return 0;
}
无聊 又写了一段 排序 奇数位置放奇数 偶数位置放偶数
最新推荐文章于 2021-11-20 10:00:53 发布