package cn.ustc.sort;public class QuickSort{
public static void main(String args[]) {
double a[] = randomDemo(10);
print(a);
quick_Sort(a,0,a.length-1);
System.out.println("快速排序后");
print(a);
} public static int partition(double a[],int low,int high){
int i,j;
i = low;
j = high;
double temp = a[j];
while(i != j){
if(a[i]<temp)
i ++;
a[j] = a[i];
j--;
if(a[j]>temp)
j--;
a[i] = a[j];
i ++;
}
a[i] = temp;
return i;
} public static void quick_Sort(double a[],int low,int high){
int part;
if(low<high)
{
part = partition(a,low,high);
quick_Sort(a,low,part-1);
quick_Sort(a,part+1,high);
}
} public static void print(double[] a){
for(int i=0;i<a.length;i++){
System.out.println(a[i]);
}
}
public static double[] randomDemo(int len){
double a[] = new double[len];
for (int i = 0; i < len; i++) {
a[i] = Math.random();
}
return a;
}
};
public static void main(String args[]) {
double a[] = randomDemo(10);
print(a);
quick_Sort(a,0,a.length-1);
System.out.println("快速排序后");
print(a);
} public static int partition(double a[],int low,int high){
int i,j;
i = low;
j = high;
double temp = a[j];
while(i != j){
if(a[i]<temp)
i ++;
a[j] = a[i];
j--;
if(a[j]>temp)
j--;
a[i] = a[j];
i ++;
}
a[i] = temp;
return i;
} public static void quick_Sort(double a[],int low,int high){
int part;
if(low<high)
{
part = partition(a,low,high);
quick_Sort(a,low,part-1);
quick_Sort(a,part+1,high);
}
} public static void print(double[] a){
for(int i=0;i<a.length;i++){
System.out.println(a[i]);
}
}
public static double[] randomDemo(int len){
double a[] = new double[len];
for (int i = 0; i < len; i++) {
a[i] = Math.random();
}
return a;
}
};
public class QuickSort {
public static void main(String args[]) {
double a[] = randomDemo(10);
print(a);
quick_Sort(a, 0, a.length - 1);
System.out.println("快速排序后");
print(a); } public static int partition(double a[], int low, int high) {
int i, j;
i = low;
j = high;
double temp = a[j];
while (i <= j) {//这里由不等于改为小于等于
if (a[i] < temp)
i++;
a[j] = a[i];
j--;
if (a[j] > temp)
j--;
a[i] = a[j];
i++;
}
a[i] = temp;
return i;
} public static void quick_Sort(double a[], int low, int high) {
int part;
if (low < high) {
part = partition(a, low, high);
quick_Sort(a, low, part - 1);
quick_Sort(a, part + 1, high);
}
} public static void print(double[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
} public static double[] randomDemo(int len) {
double a[] = new double[len];
for (int i = 0; i < len; i++) {
a[i] = Math.random();
}
return a;
}
}