题目为:
输入为:
JAVA实现使用快速排序,然后对每个数进行遍历:
快速排序的代码为:
public static int partition(double a[] ,int low,int high ){
double pivotpos=a[low];
while(low<high){
while(low<high && a[high]>=pivotpos) --high;
a[low]=a[high];
while(low<high && a[low]<=pivotpos) ++low;
a[high]=a[low];
}
a[low]=pivotpos;
return low;
}
public static void quicksort(double a[], int low, int high){
if (low<high){
int pivotpos=partition(a,low,high);