quicksort.java

简单排序的java源代码

import java.io.*;
public class quicksort{
  private static int partion(int a[],int low,int high)//partion:a[low]a[high]ҳָꣻ
  {
  	int k=a[low];//ȱa[low]ֵ
  	int priokey=a[low];//priokeyΪȽϹؼ
  	while(low<high)
  	{
  		while(low<high && a[high]>=priokey)
  			high--;
  			a[low]=a[high];//ѱpriokeyСļ¼Ƶλ
  		while(low<high && a[low]<=priokey)
  			low++;
  		a[high]=a[low];//ѱpriokeyļ¼Ƶλ
  	}
  	a[low]=k;
  	return low;//طָa[low]a[high]
  }
  private static void qsort(int a[],int low,int high)//aa[low..high]