3． 使用起泡法把给定的十个数按从大到小的顺序排列。要求输出原数列和排序后的数列。

Question

#include <stdio.h>
#define _________________
main()
{
int a[N]={2,6,4,8,34,23,45,67,54,12};
int i , j, tmp;
printf (“original order\n”);
for (i=0; i<=N-1; i++)
printf (“%4d”, ______);
for (i=1; i<=N-1; i++)
for ( j=0; j<=________;j++)
if (____________________){
tmp=a[j];
_______________;
a[j+1]=tmp;
}

Answer 1

#include <stdio.h>
#define N 10
main()
{
int a[N]={2,6,4,8,34,23,45,67,54,12};
int i , j, tmp;
printf ("original order\n");
for (i=0; i<=N-1; i++)
printf ("%4d", a[i]);
printf("\n");
for (i=1; i<=N-1; i++)
for ( j=0; j<=N-1-i;j++)
if (a[j]>a[j+1])
{
tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
for(i=0;i<N;i++)
printf("%4d",a[i]);
printf("\n");
}

Answer 2

#include <stdio.h>
#define N 10
main()
{
int a[N]={2,6,4,8,34,23,45,67,54,12};
int i , j, tmp;
printf ("original order\n");
for (i=0; i<=N-1; i++)
printf ("%4d", a[i]);
printf("\n");
for (i=1; i<=N-1; i++)
for ( j=0; j<=9-i;j++)
if (a[j]<a[j+1])
{
tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
for(i=0;i<N;i++)
printf("%4d",a[i]);
}