java 实现快速排序

public class FastSort {


/**
* 测试
* @param args
*/
public static void main(String[] args) {
final int len = 20;
int[] d = new int[len];
for(int i = 0; i < d.length; i++){
d[i] = (int)Math.round(Math.random() * len);
}
long s = System.currentTimeMillis();
FastSort.sort(d, 0, len-1);
System.out.println("Total time: " + (System.currentTimeMillis() - s));
for(int i = 0; i < d.length; i++){
System.out.println("> " + d[i]);
}
}

/**
* 快速排序
* @param data 数据
* @param left 左边界索引值
* @param right 右边界索引值
*/
public static void sort(int [] data, int left, int right){
if(left >= right)
return;

int i = left, j = right;
int base = data[i];
while(i < j){
while(data[j] >= base && j > i) j--;
while(data[i] <= base && i < j)i++;
if(i < j){
int t = data[i];
data[i] = data[j];
data[j] = t;
}
}

if(i <= j){
data[left] = data[i];
data[i] = base;
}
sort(data, left, i-1);
sort(data, j+1, right);
}
}