-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path067.c
More file actions
41 lines (41 loc) · 922 Bytes
/
067.c
File metadata and controls
41 lines (41 loc) · 922 Bytes
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
// 【程序67】
// 题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。
// 1.程序分析:谭浩强的书中答案有问题。
// 2.程序源代码:
main() {
int number[10];
input(number);
max_min(number);
output(number);
}
input(number)
int number[10]; {
int i;
for (i = 0; i < 9; i++)
scanf("%d,", &number[i]);
scanf("%d", &number[9]);
}
max_min(array)
int array[10];
{
int *max, *min, k, l;
int *p, *arr_end;
arr_end = array + 10;
max = min = array;
for (p = array + 1; p < arr_end; p++)
if (*p > *max) max = p;
else if (*p < *min) min = p;
k = *max;
l = *min;
*p = array[0]; array[0] = l; l = *p;
*p = array[9]; array[9] = k; k = *p;
return;
}
output(array)
int array[10];
{
int *p;
for (p = array; p < array + 9; p++)
printf("%d,", *p);
printf("%d\n", array[9]);
}