查找数列的最大值和最小值

#include <stdio.h>
#define Mixnumber 5




int Maopao(int *n){
int pass, i,z;
for (pass = 1; pass < Mixnumber; pass++){
for (i = 0; i < Mixnumber - pass; i++){
if (n[i] > n[i + 1]){
z = n[i];
n[i] = n[i + 1];
n[i + 1] = z;
}
}
}
}


int main(){
int a[Mixnumber];
int i, x;


printf("请输入你想要数列的值:");
for (i = 0; i < Mixnumber; i++)
scanf_s("%d", &a[i]);


printf("你输入的数组为:");
for (i = 0; i < Mixnumber; i++)
printf("%d  ", a[i]);


Maopao(a);
printf("\n这个数列的最大值为:%d", a[Mixnumber-1]);
printf("\n这个数列的最小值为:%d", a[0]);
return 0;

}


猜你喜欢

转载自blog.csdn.net/qq_42082542/article/details/80108764