分治法求k1小到k2z小之间的整数

public class Quick {
static int findMid(int low,int high,int arr[]){
arr[0] = arr[low];
while(low<high){
while(low<high && arr[high] >= arr[0])
high--;
arr[low] = arr[high];
while(low<high && arr[low] <= arr[0])
low++;
arr[high] = arr[low];
}
arr[low]=arr[0];
return low;

}
static void findKK(int arr[],int low,int high,int k1,int k2,boolean findK2){
int s;
if(low<high){
s = findMid(low,high,arr);
if(s>k1){
if(s == k2)
findK2 = true;
findKK(arr,low,s-1,k1,k2,findK2);
}

else if(s<k1){
findKK(arr,s+1,high,k1,k2,findK2);
}
else if(s == k1){
return;