#include<stdio.h>
void main()
{
    int i,j,k,min;
    float a[100];
    float m,ave;
    printf("please enter the number of items:\n");
    scanf("%d",&k);
    printf("please enter the items:\n");
    for(i=0;i<k;i++)
        scanf("%f",&a[i]);
    printf("\n");
    for(j=0;j<k;j++)
    {  
       for(i=1;i<k-j;i++)
   
            if(a[i]>a[i+1])
               
                m=a[i+1];
                a[i+1]=a[i];
                a[i]=m;
        

    }
    for(i=0;i<k;i++)
        printf("%f  ",a[i]);
    if(k%2==0)
        ave=(a[k/2]+a[k/2-1])/2;
    else
        ave=a[(k-1)/2];
    printf("the average is: %f",ave);
}
想请教下  这我想用冒泡排序  我觉得没有问题   但是就是不真确  帮我看看怎么改  谢谢！
还有  想请教大侠排序算法的经典例子  谢谢

#include<stdio.h>
void main()
{
    int i,j,k,min;
    float a[100];
    float m,ave;
    printf("please enter the number of items:\n");
    scanf("%d",&k);
    printf("please enter the items:\n");
    for(i=0;i<k;i++)
        scanf("%f",&a[i]);
    printf("\n");
    for(j=0;j<k-1;j++)            //注意i和j循环条件
    {  
       for(i=0;i<k-j-1;i++)
   
            if(a[i]>a[i+1])
               
                {
                    m=a[i+1];   //别漏了{  }
                a[i+1]=a[i];
                a[i]=m;
                }
        

    }
    for(i=0;i<k;i++)
        printf("%f  ",a[i]);
    if(k%2==0)
        ave=(a[k/2]+a[k/2-1])/2;
    else
        ave=a[(k-1)/2];
    printf("the average is: %f",ave);
}
排序还可以采用比较法：
#include<stdio.h>
void main()
{
    int i,j,k,min;
    float a[100];
    float m,ave;
    printf("please enter the number of items:\n");
    scanf("%d",&k);
    printf("please enter the items:\n");
    for(i=0;i<k;i++)
        scanf("%f",&a[i]);
    printf("\n");
    for(j=0;j<k-1;j++)
    {  
       for(i=j+1;i<k;i++)
   
            if(a[j]>a[i])
               
                {
                    m=a[i];
                a[i]=a[j];
                a[j]=m;
                }
        

    }
    for(i=0;i<k;i++)
        printf("%f  ",a[i]);
    if(k%2==0)
        ave=(a[k/2]+a[k/2-1])/2;
    else
        ave=a[(k-1)/2];
    printf("the average is: %f",ave);
}


[ 本帖最后由 m456m654 于 2009-10-10 17:20 编辑 ]

除了选择排序就是冒泡排序，还有什么？

我无聊写的：
/*冒泡法*/
void bubble(int array[],int num,int flag)
{
    int i,j;
    int temp;
    for(i = 0; i < num-1; i++)/* from 0 to num -2 */
    {
        if(flag)
        {
           for(j = 0; j < num - 1- i;j++)/* from 0 to num - 3 - i and i indicates how many elements have been OK*/
           {
               if(array[j] > array[j+1])
               {
                temp = array[j];
                array[j] = array[j+1];
                array[j+1] = array[j];
               }
           }
        }
        else
        {
            for(j = num - 1;j >= i; j--)
            {
                if(array[j] < array[j-1])
                {
                    temp = array[j];
                    array[j] = array[j-1];
                    array[j-1] = temp;
                }
            }
        }
    }

}
/*
   交换法
*/
void change(int array[],int num)
{
    int i,j;
    int temp;
    for(i = 0;i < num -1;i++)
    {
        for(j = i+1;j < num -1;j++)
        {
            if(array[j] < array[i])
            {
                temp = array[j];
                array[j] = array[i];
                array[i] = temp;
            }
        }
    }

}
/*
   插入法
*/
void insert(int array[],int num)
{
    int i,j;
    int temp;
    for( i = 1;i < num-1; i++)
    {
        temp = array[i];
        j = i-1;
        while((j>= 0) && (array[j] >temp))
        {
            array[j+1] = array[j];
                j--;
        }
        array[j+1] = temp;
    }
}

干嘛把flag放循环内呢？放外面不是更好？

flag的作用是控制冒泡是向后还是向前，你觉得放在外面应该怎么写？

谢谢各位了 呵呵