代码1(无序):
#include<stdio.h>
#include<windows.h>
void Swap(int *a, int n)//也可以这样写int a[],一般推荐前者
{
int left = 0;
int right = n - 1;
int temp = 0;
while (left < right)
{
// 从前往后,找到一个偶数,找到后停止
while ((left < right) && (a[left] % 2 != 0))
{
left++;
}
// 从后往前找,找一个奇数,找到后停止
while ((left < right) && (a[right] % 2 == 0))
{
right--;
}
// 如果偶数和奇数都找到,交换这两个数据的位置
// 然后继续找,直到两个指针相遇
if (left < right)
{
temp = a[left];
a[left] = a[right];
a[right] = temp;
}
}
}
int main()
{
int a[] = {
1,2,3,4,5,6,7,8,9,10};
int num = sizeof(a) / sizeof(a[0]);
Swap(a,num);
int i = 0;
for (; i < num; i++)
{
printf("%d ", a[i]);
}
printf("\n");
system("pause");
return 0;
}
//运行环境:vs2019
附图:
代码2(有序):
#include<stdio.h>
#include<windows.h>
void Swap(int* a,int n)
{
//把一个数组的奇数放到前面
int i = 0, j = 0;
int temp = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (a[j] % 2 == 0 && a[j + 1] % 2 != 0)
{
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
}
int main()
{
int a[] = {
1,2,3,4,5,6,7,8,9,10 };
int num = sizeof(a) / sizeof(a[0]);
Swap(a, num);
int i = 0;
for (; i < num; i++)
{
printf("%d ", a[i]);
}
printf("\n");
system("pause");
return 0;
}
//运行环境:vs2019
附图: