#include<stdio.h>
int main()
{
int n,i,j;
int pos,temp;
int a[10];
printf("please input n\n");
scanf("%d",&n);
printf("please in put n no\n");
  for(i=0;i<n;i++)
      scanf("%d",&a[i]);
    for(i=0;i<n-1;i++)
  {
      pos=i;
      for(j=i+1;j<n;j++)
          if(a[pos]<a[j])
              pos=j;
      
      if(pos!=i)
      {
          temp=a[i];
          a[i]=a[j];
          a[j]=temp;
      }
  }

  for(i=0;i<n;i++)
      printf("%8d",a[i]);
}
题目要求是:输入一个正整数n(1<n<=10),再输入n个整数，将它们从小到大排序后输出


[ 本帖最后由 王启元 于 2010-4-21 22:06 编辑 ]

试试这个。

#include <stdio.h>
int main(int argc, char *argv[])
{
int n,i,j;
int temp;
int a[10];
printf("please input n\n");
scanf("%d",&n);
printf("please in put n no\n");
  for(i=0;i<n;i++)
      scanf("%d",&a[i]);
    for(i=0;i<n-1;i++)
      for(j=0;j<n-i;j++)
      {
          if(a[j]>a[j+1])
         {
           temp=a[j+1];
          a[j+1]=a[j];
          a[j]=temp;
         }
     }


  for(i=0;i<n;i++)
      printf("%8d",a[i]);

    return 0;
}

 

你的排序算法有问题：
for(i=0;i<n-1;i++)
  {
      pos=i;
      for(j=i+1;j<n;j++)
          if(a[pos]<a[j])
              pos=j;
      
      if(pos!=i)
      {
          temp=a[i];
          a[i]=a[j];
          a[j]=temp;
      }
  }

好像还不dui

恩，好像是的 可怎么该啊？

sorry,一时快了忘了-1，楼主请复习冒泡排序算法！


int main(int argc, char *argv[])
{
int n,i,j;
int temp;
int a[10];
printf("please input n\n");
scanf("%d",&n);
printf("please in put n no\n");
  for(i=0;i<n;i++)
      scanf("%d",&a[i]);
    for(i=0;i<n-1;i++)
      for(j=0;j<n-i-1;j++) /*这里要-1*/
      {
          if(a[j]>a[j+1])
         {
           temp=a[j+1];
          a[j+1]=a[j];
          a[j]=temp;
         }
     }


  for(i=0;i<n;i++)
      printf("%8d",a[i]);

    return 0;
}

我试过这样可以
#include<stdio.h>
int main()
{
        int n, i, j, pos, temp, a[10];
        printf("please input n\n");
        scanf("%d", &n);
        printf("please input n no\n");
        for(i = 0; i < n; i++)
                scanf("%d",&a[i]);
        for(i = 0; i < n - 1; i++)
        {
        //      pos = i;
                for(j = i + 1; j < n; j++)
                {
                        if(a[i] > a[j])
                        {
                                temp = a[i];
                                a[i] = a[j];
                                a[j] = temp;
                          }
             }
        }
        for(i = 0; i < n; i++)
                printf("%8d", a[i]);
        printf("\n");
        return 0;
}

嗯，不错。谢谢

直接把前面的那部分去了
 for(i = 0; i < n - 1; i++)
        for(j=i+1;j<n;j++)
                       if(a[i] > a[j])
                        {
                                temp = a[i];
                                a[i] = a[j];
                                a[j] = temp;
                          }
             }
        }
        for(i = 0; i < n; i++)
                printf("%8d", a[i]);
        printf("\n");
        return 0;