|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
#include<stdio.h>
#include<stdlib.h>
void
adjust_arr(
int
arr[],
int
size)
{
int
temp;
int
i, j;
/*将奇位数放在前，偶位数放在后*/
//if (size % 2 == 1)
//{
// i = 1; j = size-1;
//}
//else
//{
// i = 1; j = size - 2;
//}
//for (; i <= j; i += 2, j -= 2)
//{
// temp = arr[i];
// arr[i] = arr[j];
// arr[j] = temp;
//}
/*将奇数放在前，偶数放在后*/
for
(i =
0
,j = size-
1
; i <j; )
{
if
((arr[i] %
2
==
0
) && (arr[j] %
2
==
1
))
//如果奇数在后，偶数在前，则进行调换
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
if
(arr[i] %
2
==
1
)
//如果arr[i]为奇数，i++
i++;
if
(arr[j] %
2
==
0
)
//如果arr[j]为偶数，j--
j--;
}
}
int
main()
{
int
arr[] = {
2
,
3
,
4
,
5
,
6
,
7
,
10
,
11
,
12
,
13
,
14
,
15
,
16
,
8
,
9
,
17
,
18
,
19
,
20
};
int
i;
int
size = sizeof(arr) / sizeof(arr[
0
]);
adjust_arr(arr, size);
//函数调用，队数组进行排序，
for
(i =
0
; i < size; i++)
printf(
"%d "
,arr[i]);
printf(
"\n"
);
system(
"pause"
);
return
0
;
}
|
转自https://www.2cto.com/kf/201511/450151.html