冒泡太慢了;用快排!
void SWAP(int &a,int &b)
{
	int p;
	p=a;
	a=b;
	b=p;
}
void quicksort(int list[ ], int left, int right)
{
    int  pivot, i, j ;
    if ( left < right ){
       i=left;   
	   j=right+1;
       pivot=list[left]; 
       do{
           do
		   i++;
           while (list[ i ]< pivot);
           do            
		   j--;
           while (list[ j ]> pivot); 
           if  ( i < j )SWAP(list [ i ],list [ j ]);
        }  while ( i < j );
        SWAP( list [ left ], list [ j ]);
        quicksort( list, left, j-1);
        quicksort( list, j+1, right);
    } 
}