-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcase67.c
More file actions
66 lines (56 loc) · 1.38 KB
/
Copy pathcase67.c
File metadata and controls
66 lines (56 loc) · 1.38 KB
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
58
59
60
61
62
63
64
65
66
// 题目:输入数组,最大的与第一个元素交换,最小的与最后一个元素交换,输出数组。
#include<stdio.h>
void changeMax(int[],int);
void changeMin(int[],int);
void switchPosition(int *,int,int);
int main()
{
int nums[10]={2,45,7,2,65,12,67,19,3,8};
int len = sizeof(nums)/sizeof(nums[0]);
changeMax(nums,len);
changeMin(nums,len);
for (int i = 0; i < 10; i++)
{
printf("%d ",nums[i]);
}
return 0;
}
void changeMax(int nums[],int len){
// int len = sizeof(nums)/sizeof(nums[0]); num传值,编译器自动把num识别成指针变量了,sizeof的大小不是数组的大小,是指针的大小,恒为8
int max = nums[0];
int max_index = 0;
for(int i=1;i<len;i++)
{
if (nums[i]>max)
{
max = nums[i];
max_index = i;
}
else{
continue;
}
}
switchPosition(nums,0,max_index);
}
void changeMin(int *nums,int len){
int min = nums[0];
int min_index = 0;
for(int i=1;i<len;i++)
{
if (nums[i]<min)
{
min = nums[i];
min_index = i;
}
else{
continue;
}
}
switchPosition(nums,len-1,min_index);
}
void switchPosition(int *nums,int a, int b)
{
int temp=nums[a];
nums[a] = nums[b];
nums[b] = temp;
}