#include <stdio.h>
void shuru(int arr[], int n);
void chuli(int arr[], int n);
void shuchu(int arr[], int n);
int main()
{
int arr[10];
shuru(arr,10);
chuli(arr,10);
shuchu(arr,10);
return 0;
}
void shuru(int arr[],int n)
{
int i = 0;
for (i = 0; i < n; i++)
{
scanf_s("%d", &arr[i]);
}
}
void chuli(int arr[], int n)
{
int i = 0;
int tmp1 = 0;
int tmp2 = 0;
int max = arr[0];
int min = arr[0];
int maxi = 0;
int minj = 0;
for (i = 0; i < n; i++)
{
if (max < arr[i])
{
max = arr[i];
maxi = i;
}
}
if (max != arr[9])
{
tmp1 = arr[9];
arr[9] = arr[maxi];
arr[maxi] = tmp1;
}
for (i = 0; i < n; i++)
{
if (min > arr[i])
{
min = arr[i];
minj = i;
}
}
if (min != arr[0])
{
tmp2 = arr[0];
arr[0] = arr[minj];
arr[minj] = tmp2;
}
}
void shuchu(int arr[], int n)
{
int i = 0;
for (i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
}
将其中最小的数与第一个数对换,把最大的数与最后一个数对换
结果: