用递归法实现N元实型数组由大到小冒泡排序

#include<stdio.h>
#define N 8
void sort(double a[],int n)
{
    int j;double t;
    if(n<=0)return;
    for(j = 0;j<N;j++)
    {
        if(a[j]<a[j+1]){t = a[j];a[j] = a[j+1];a[j+1] = t;}
    }    
        sort(a,n-1);
}
int main()
{
    double a[N];
    int i;
    for(i = 0;i<N;i++)scanf("%lf",&a[i]);
    sort(a,N-1);
    for(i = 0;i<N;i++)printf("%8.2f",a[i]);
    return 0;
 }