gcc编译冒泡法和vc编译的不同

         冒泡法就是将一组无序的数,按照一定排序输出,采用两两对比的方式

利用gcc编译冒泡:                                                                     利用vc编译冒泡:

#include <stdio.h>                                                                       #include <stdio.h> 

#define N 5                                                                                    int main()

 int main()                                                                                       {
{                                                                                                                         int i,j,n,temp;

    int i,j,a[N];                                                                                                    int a[10];

    int temp;                                                                                                       for(i=0;i<10;i++)

    printf("put input:  \n");                                                                                  scanf ("%d,",&a[i]);

    for(i=0;i<N;i++)                                                                                             for(i=0;i<9;i++)

    {                                                                                                                       { for (j=0;j<10-i-1;j++) 

        printf("a[%d]=",i);                                                                                       if (a[j]>a[j+1]) 

        scanf("%d",&a[i]);                                                                                      { temp=a[j];

    }                                                                                                                              a[j]=a[j+1];

    for(i=0;i<N;i++0)                                                                                                   a[j+1]=temp; } 

    {                                                                                                                                }

        for(j=0;j<N-i-1;i++)                                                                                        for(i=0;i<10;i++)

        {                                                                                                                             printf("%5d,",a[i] );

            if(a[j]<a[j+1])                                                                                                    printf("\n");

            {                                                                                                            }

                 temp=a[j+1];

                 a[j+1]=a[j];

                  a[j]=temp;

            }

        }

    }

    for(i=0;i<N;i++)

    {

        printf("%d\n ",a[i]);

    }

    return 0;

}

gcc运行结果:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值