m=a[i];
*p=i;
}
}
return m;
}
int min(int a[],int n,int *p){
int i=0,m=a[0];
*p=i;
for(i=1;i
if(m>a[i]){
m=a[i];
*p=i;
}
}
return m;
}
int main(){
int m,n,t=0,*p=&t,a[10]={31,28,73,83,27,56,12,43,34,63};
m=max(a,10,p);
printf("最大值为%d,位置为%d\n",m,*p);
n=min(a,10,p);
printf("最小值为%d,位置为%d\n",n,*p);
return 0;
}
![](/picurl?url=https%3A%2F%2Fiknow-pic.cdn.bcebos.com%2F4d086e061d950a7b149180b81ad162d9f2d3c922%3Fx-bce-process%3Dimage%252Fresize%252Cm_lfit%252Cw_600%252Ch_800%252Climit_1%252Fquality%252Cq_85%252Fformat%252Cf_auto)
![](/picurl?url=https%3A%2F%2Fiknow-pic.cdn.bcebos.com%2F6f061d950a7b02086c6df19d72d9f2d3572cc822%3Fx-bce-process%3Dimage%252Fresize%252Cm_lfit%252Cw_600%252Ch_800%252Climit_1%252Fquality%252Cq_85%252Fformat%252Cf_auto)
![](/picurl?url=https%3A%2F%2Fiknow-pic.cdn.bcebos.com%2Fa8014c086e061d951fe2f9446bf40ad162d9ca22%3Fx-bce-process%3Dimage%252Fresize%252Cm_lfit%252Cw_600%252Ch_800%252Climit_1%252Fquality%252Cq_85%252Fformat%252Cf_auto)