快速排序思想,先找数组第k小的数,当执行一次partition函数找到index下标时,index左边的数比arr[index]小,右边的数比arr[index]大
public class Test {
//快速排序寻找一次数字正确位置的下标
public static int partition1(int [] arr,int low,int high){
int temp=arr[low
while (low < high){
while (low< high && arr[high]>temp){
high--;
}
arr[low]=arr[high];
while (low< high && arr[low]<temp){
low++;
}
arr[high]=arr[low];
}
arr[low]=temp;
return low;
}
public static void main(String[] args) {
int[] arr=new int[]{
4,1,8