TA貢獻1017條經(jīng)驗 獲得超1032個贊
#include"stdio.h"?
void?main()
{
int?arr[10];
int?max,min,temp;
int?index1=0,index2=0;
printf("請輸入10個整數(shù):\n");
scanf("%d",&arr[0]);
max=min=arr[0];
for(int?i=1;i<10;i++)
{
scanf("%d",&arr[i]);
if(arr[i]>max)
{
max=arr[i];
index1=i;
}
if(arr[i]<min)
{
min=arr[i];
index2=i;
}
}
temp=arr[index1];
arr[index1]=arr[index2];
arr[index2]=temp;
for(i=0;i<10;i++)
printf("%d?",arr[i]);
printf("\n");
}
TA貢獻8條經(jīng)驗 獲得超10個贊
/**
?????*?數(shù)組升序方法
?????*?@param?array
?????*/
????public?void?Ascending(int[]?array){
????????int?arr;
????????for(int?j=0;j<array.length-1;j++){//執(zhí)行次數(shù)
????????????for(int?i=0;i<array.length-1;i++){//將數(shù)組中最大值放入最后
????????????????if(array[i]>array[i+1]){
????????????????????arr?=?array[i];
????????????????????array[i]?=?array[i+1];
????????????????????array[i+1]?=?arr;
????????????????}
????????????}
????????}
????}
????
????/**
?????*?數(shù)組降序方法
?????*?@param?array
?????*/
????public?void?Descending(int[]?array){
????????int?arr;
????????for(int?j=0;j<array.length-1;j++){//執(zhí)行次數(shù)
????????????for(int?i=0;i<array.length-1;i++){//將數(shù)組中最小值放入最后
????????????????if(array[i]<array[i+1]){
????????????????????arr?=?array[i];
????????????????????array[i]?=?array[i+1];
????????????????????array[i+1]?=?arr;
????????????????}
????????????}
????????}
????}舉報