#include <iostream>
#include <vector>
using namespace std;
void reOrderEvenOdd(vector<int> &array, int begin, int end){
if (!array.size())
return;
if ((end - begin) <= 0)
return;
int OddIndex = begin;
int EvenIndex = end;
unsigned int a = 1;
while (EvenIndex > OddIndex){
//奇数
cout << array[OddIndex]<<" ";
while (array[OddIndex] & a)
OddIndex++;
while (!(array[EvenIndex] & a))
EvenIndex--;
if (OddIndex < EvenIndex){
int temp = array[OddIndex];
array[OddIndex] = array[EvenIndex];
array[EvenIndex] = temp;
//OddIndex++;
//EvenIndex--;
}
}
}
奇偶排序
最新推荐文章于 2024-06-19 09:41:13 发布