#define N 10
#include <stdio.h>
#include <stdlib.h>

int len_a = 0 ;   //全局變量:數(shù)組長(zhǎng)度 
int initLen( int Len[])          //由輸入初始化數(shù)組 
{
    printf("請(qǐng)輸入數(shù)組長(zhǎng)度:");
    scanf("%d",&len_a);
    printf("請(qǐng)輸入數(shù)組元素(用空格隔開(kāi)):");    
    for( int i = 0 ; i < len_a ; i++ )
        scanf("%d",&Len[i]) ;
    
    return 0 ;
}

int partLen( int Len[] , int head , int tail , int &middle)      //劃分?jǐn)?shù)組 
{
    int i = head , j = tail , key = Len[head] ;
    while( i < j )
    {
        while( Len[j] > key && i < j )
                j -- ;                
        if( i < j )
        {
                Len[i] = Len[j] ;
                i ++ ;
        }    
        while( Len[i] < key && i < j )
                i ++ ;
        if( i < j )
        {       
            Len[j] = Len[i] ;
            j -- ;
        }       
    }
    Len[i] = key ;
    middle = i ;
    return 0 ;
}

int QuickSork( int Len[] , int head , int tail )    //排序        
{   
    int middle ;
    if( head < tail )
    {
        partLen( Len , head , tail , middle ) ;
        QuickSork( Len , head , middle-1 );       
        QuickSork( Len , middle+1 , tail );
    }
    return 0 ;       
}

int showLen( int Len[] )         //數(shù)組輸出 
{
    for( int i = 0 ; i < len_a ; i++ )
        printf("%4d",Len[i]);
    return 0 ;
}

int main()
{   
    int Len[N] ;
    
    initLen( Len ) ;
    QuickSork( Len , 0 , len_a-1 ); 
    printf("-------------------------\n");
    printf("排序后的數(shù)串為："); 
    showLen( Len );
    
    getchar() ;getchar() ;
    return 0 ;
}