kuais.java

简单排序的java源代码

  class kuaipai{
  int paixu(int a[],int i,int j){
  	int k=a[i];
  	int x=a[i];
  	while(i<j)
  	{
  		while(i<j && a[j]>=x)
  			j--;
  			a[i]=a[j];
  		while(i<j && a[i]<=x)
  			i++;
  		a[j]=a[i];
  	}
  	a[i]=k;
  	return i;
  }
  void zaipai(int a[],int i,int j){
  	if(i<j)
  	{
       int y=paixu(a,i,j);
       zaipai(a,i,y-1);
       zaipai(a,y+1,j);
  	}
  }
  void diaoyong(int a[],int length){
  	zaipai(a,0,length);
  }
  }
  class mine{
  public static void main(String args[]){
  	kuaipai aa=new kuaipai();
  	int array[]={20,10,50,40,30,70,60,80,90,100};
  	int k=0;
    System.out.println("排序后:");
    aa.diaoyong(array,9);
    for(k=0;k<10;k++)
{
System.out.print(" "+array[k]);
}
System.out.println();
}
}