zoukankan      html  css  js  c++  java
  • 2016.数据的交换输出

    #include <stdio.h>
    int main()
    {
        int n,i,t,min,k,j;
        while(scanf("%d",&n)&&n!=0)
        {
            int a[n];
            for(i=0;i<n;i++)
                scanf("%d",&a[i]);
            for(i=0;i<n-1;i++)
                for(j=i+1;j<n;j++)
                    if(a[i]>a[j])
                    {
                        t=a[j];
                        min=j;
                    }
            k=a[0];
            a[0]=t;
            a[min]=k;
            for(i=0;i<n;i++)
                printf("%d ",a[i]);
            printf(" ");
        }
        return 0;
    }

  • 相关阅读:
    Transformer详解
    PAT 1012
    PAT 1011
    PAT 1010
    Jordan Lecture Note-3: 梯度投影法
    PAT 1009
    PAT 1008
    Jordan Lecture Note-2: Maximal Margin Classifier
    PAT 1007
    PAT 1006
  • 原文地址:https://www.cnblogs.com/huoyuying/p/9736596.html
Copyright © 2011-2022 走看看