java快速排序

基本原理参考：

http://www.cnblogs.com/yanzi629/archive/2010/11/20/1882863.html

代码如下：

package lele;

public class Lele {

public static void quickSort(int[] v, int left, int right){

if(left<right){

int key=v[left];

int low=left;

int high=right;

while(low<high){

while(low<high&&v[high]>key){

high--;

}

v[low]=v[high];

while(low<high&&v[low]<key){

low++;

}

v[high]=v[low];

}

v[low]=key;

quickSort(v,left,low-1);

quickSort(v,low+1, right);

}

}

public static void main(String[] args){

int[] v={2,4,9,3,6,7,1,5};

quickSort(v,0,7);

    for(int i=0; i<v.length; i++)

    System.out.print(v[i] + " ");

}

}