#include<stdio.h>


main()
{
    int a[20];
    int i,c,n,temp,h,l=0;
    printf("Input the length of the array(<20):");
    scanf("%d",&n);
    printf("\nInput %d datas:",n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("\nThe array are:");
    for(i=0;i<n;i++)
    {
        printf("%4d",a[i]);
    }
    h=n-1;
    temp=a[0];

    while(l<h)
    {
        while(temp<a[h])
            h=h-1;
        if(a[l]>a[h])
        {
            c=a[l];
            a[l]=a[h];
            a[h]=c;
            l=l+1;
        }
        else
            h=h-1;
        if(a[h]<a[l])
        {
            c=a[l];
            a[l]=a[h];
            a[h]=c;
            h=h-1;
        }
        else
            l++;
    }

    printf("\n\nThe array after quicksort are:");
    for(i=0;i<n;i++)
    {
        printf("%4d",a[i]);
    }
    printf("\n\n");
}

//bug_a
for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
//bug_b 快速排序的数组有点看不懂改成了冒泡排序

#include<stdio.h>


main()
{
    int a[20];
    int i,j,c,n,temp,h,l=0;
    printf("Input the length of the array(<20):");
    scanf("%d",&n);
    printf("\nInput %d datas:",n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("\nThe array are:");
    for(i=0;i<n;i++)
    {
        printf("%4d",a[i]);
    }
    for(i=0;i<n-1;i++){
        for(j=0;j<n-i-1;j++)
        {
            if(a[j]>a[j+1]){
                temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
    }
    printf("\n\nThe array after quicksort are:");
    for(i=0;i<n;i++)
    {
        printf("%4d",a[i]);
    }
    printf("\n\n");
}

谢大神，自己后来在while那改了也可以了。
    while(l<h)
    {
        if((a[l]>temp)||(a[h]<temp))
        {
            c=a[l];
            a[l]=a[h];
            a[h]=c;
        }
        while(a[l]<temp)
        {
            l++;
            break;
        }
        while(a[h]>temp)
        {
            h--;
            break;
        }
       }

我不是什么大神，只是一个小白