#include
void main(){
int i,max,min,n;
scanf("%d",&n);
max=n;min=n;
for(i=1;i<10;i++){
scanf("%d",&n);
if(maxif(min>n) min=n;
}
printf("最大数:%d,最小数:%d",max,min);
}
运行示例:
#include
#include
//快速排序
int Partition_1(int arr[],int low,int high)
{
int pivotloc=arr[low],temp;
while(low{
while(low=pivotloc)
--high;
temp=arr[low];
arr[low]=arr[high];
arr[high]=temp;
while(low++low;
temp=arr[low];
arr[low]=arr[high];
arr[high]=temp;
}
return low;
}
void QSort(int *arr,int n,int low,int high)
{
int pivotloc;
if(low{
pivotloc=Partition_1(arr,low,high);
QSort(arr,n,low,pivotloc-1);
QSort(arr,n,pivotloc+1,high);
}
}
void QuickSort(int *arr,int n)
{
QSort(arr,n,0,n-1);
}
int main()
{
int arr[]={1,3,5,4,6,2,7,9,8,0};
int i=0;
QuickSort(arr,10);
printf("最大值:%d\t最小值:%d\n",arr[9],arr[0]);
return 0;
}
#include
void main()
{ int max,min,x,n;
printf("请输入第1个数:");
scanf("%d",&x);
max=min=x;
for(n=2;n<=10;n++)
{printf("请输入第%d个数:",n);
scanf("%d",&x);
if(x>max) {max=x;continue;}
if(x
printf("最大数是:%d\n最小数是:%d\n",max,min);
}
所有数放入数组,按数值大小升序排序,首尾两个即最小最大数