Question

一个排序题【追赏，谢谢】

将数组{8, 23, 4, 16, 77, -5, 53, 100}中的元素按从大到小的顺序排列，每次可以交换任意两个元素，最少需要交换（ ）次。
A. 4 B. 5 C. 6 D. 7 E. 8
请附上想法好吗，是5次，不过为什么这么排

Answer 1

5次

8, 23, 4, 16, 77, 100, 53, -5
100, 23, 4, 16, 77, 8, 53, -5
100, 23, 53, 16, 77, 8, 4, -5
100, 77, 53, 16, 23, 8, 4, -5
100, 77, 53, 23, 16, 8, 4, -5

Answer 2

10个数的供参考
#include<stdio.h>
#include<conio.h>
int main(void)
{
long arrary[9],
box=0L;
int i1=0,
i2=0;
for(i1=0;i1<9;i1++)
arrary[i1]=0;
printf("输入数组元素：\n");
for(i1=0;i1<=9;i1++)
{
printf("%3d>",i1+1);
scanf("%d",&arrary[i1]);
}
for(i1=0;i1<=9;i1++)
for(i2=0;i2<=9-i1;i2++)
{
if(arrary[i2]<arrary[i2+1])
{
box=arrary[i2+1];
arrary[i2+1]=arrary[i2];
arrary[i2]=box;
}
}
printf("\n排序后为：\n");
for(i1=0;i1<=9;i1++)
printf("%3d>%d\n",i1+1,arrary[i1]);
getch();
return 0;
}

Answer 3

7次 冒泡法！

Answer 4

5次

8, 23, 4, 16, 77, 100, 53, -5
100, 23, 4, 16, 77, 8, 53, -5
100, 23, 53, 16, 77, 8, 4, -5
100, 77, 53, 16, 23, 8, 4, -5
100, 77, 53, 23, 16, 8, 4, -5
强调 特殊 不考虑算法