一、/**快速排序*/publicvoid_quickSort(int[]list,intlow,inthigh){if(low<high){intmiddle=getMiddle(list,low,high);//将数组进行一分为二_quickSort(list,low,middle-1);//对低位进行递归排序_quickSort(list,middle+1,high);//对高位进行递归排序}}publicintgetMiddle(int[]list,intlow,inthigh)...
查看全文