public static void quickSort(int[] arr, int low, int high){
if (low >= high) {
return;
}
int part = partition(arr, low, high);
quickSort(arr, low, part - 1);
quickSort(arr, part + 1, high);
}
如果不加上if (low >= high) {
return;
} 就会报栈溢出的错误?
我想知道是为什么?