-
Notifications
You must be signed in to change notification settings - Fork 311
/
ch-2.c
44 lines (40 loc) · 775 Bytes
/
ch-2.c
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
#include <stdio.h>
#include <stdlib.h>
void sort(int x[], int xlen) {
int cnt = 0;
do {
cnt = 0;
for (int i = 0; i < xlen - 1; i++) {
if (x[i] > x[i+1]) {
cnt++;
int tmp = x[i];
x[i] = x[i+1];
x[i+1] = tmp;
}
}
} while (cnt != 0);
}
void proc(int ints[], int len) {
printf("Input: ");
for (int i = 0; i < len; i++)
printf("%d ", ints[i]);
int* new = malloc(len * sizeof(int));
sort(ints, len);
int j = 0;
do {
int x = ints[j];
int y = ints[j+1];
new[j] = y;
new[j+1] = x;
j += 2;
} while (j < len);
printf("\nOutput: ");
for (int i = 0; i < len; i++)
printf("%d ", new[i]);
printf("\n");
free(new);
}
int main() {
int ints[] = {2, 5, 3, 4};
proc(ints, sizeof(ints) / sizeof(int));
}