#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);
}
想请教下  这我想用冒泡排序  我觉得没有问题   但是就是不真确  帮我看看怎么改  谢谢！
还有  想请教大侠排序算法的经典例子  谢谢

谢谢各位了 呵呵