交换最小值和最大值

九脚墨鱼

于 2022-12-03 19:25:21 发布

阅读量713

点赞数 1

文章标签：算法蓝桥杯 c++

本文链接：https://blog.csdn.net/m0_72521490/article/details/128165240

版权

#include<stdio.h>
#define maxn 10
int main(void)
{
   int i, index, k, n, temp;
   int a[maxn];

   scanf ("%d", &n);
   for (i = 0;i < n;i++)
   {
       scanf ("%d", &a[i]);
   }
   index = 0;
   for (i = 1;i < n;i++)
   {
       if (a[i] < a[index])
       {
           index = i;
       }
   }
   temp = a[index];
   a[index] = a[0];
   a[0] = temp;
   for (i = 1;i < n;i++)
   {
       if (a[i] > a[index])
       {
           index = i;
       }
   }
   temp = a[index];
   a[index] = a[n - 1];
   a[n - 1] = temp;
   for (i = 0;i < n;i++)
   {
       printf ("%d ", a[i]);
   }
   printf ("\n");


   return 0;
}