快速排序

#include<stdio.h>

int a[100];
int n;

void quicksort( int left,int right );

int main()
{
int i,j;
scanf( "%d",&n );

for( i = 0;i < n;i++ )
{
scanf( "%d",&a[i] ); //输入数据
}
quicksort( 0,n-1 ); //快排

for( i = 0;i < n;i++ )
{
printf( "%d ",a[i] );
}
printf( "\n" );
return 0;
}

void quicksort( int left,int right )
{
int i,j,t,tmp;
if( left > right )
{
return ;
}

tmp = a[ left ]; //将最左元素当做比较基准
i = left;
j = right;
while( i != j )
{
while( a[j] >= tmp && i < j ) //一定是j先移动
{
j--;
}
while( a[i] <= tmp && i < j )
{
i++;
}
if( i < j )
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
a[ left ] = a[i];  //基准归位
a[i] = tmp;

quicksort( left,i-1 );
quicksort( i+1,right );
return ;
}

2 5 3