package xwq.sort;
import xwq.util.In;
import xwq.util.StdOut;
/**
* 使用
* 1、插入排序
* 2、三取样获取基准值
* 3、三向切分
* 优化快速排序
* @author batman
*
*/
public class QuickSortOptimal {
private static int M = 10;
public static void sort(int a[]) {
partition(a,0,a.length-1);
}
private static void partition(int a[],int low,int high) {
if(low>=high) return;
int N = high - low + 1;
if(N<=M) {
insertSort(a,low,high);
return;
}
if(N<=40) {
int m = median3(a,low,low+N/2,high);
swap(a,low,m);
}
else {
int len = N/8;
int mid = low + N/2;
int m1 = median3(a,low,low+len,low+len+len);
int m2 = median3(a,mid-len,mid,mid+len);
int m3 = median3(a,high-len-len,high-len,high);
int m = median3(a,m1,m2,m3);
swap(a,low,m);
}
int pivot = a[low];
int l = low, i = low+1, h = high;
while(i <= h) {
if(a[i] < pivot) swap(a,l++,i++);
else if(a[i] > pivot) swap(a,i,h--);
else i++;
}
partition(a,low,l-1);
partition(a,h+1,high);
}
private static void insertSort(int a[],int low,int high) {
for(int i = low+1;i<=high;i++) {
int insert = a[i];
int pos = i-1;
while(pos>=low && a[pos]>insert) {
a[pos+1] = a[pos];
pos--;
}
a[pos+1] = insert;
}
}
private static int median3(int a[],int low,int mid,int high) {
if(a[low] > a[mid] && a[low] < a[high])
return low;
if(a[low] > a[mid] && a[mid] < a[high])
return mid;
return high;
}
private static void swap(int a[],int i,int j) {
int t = a[i]; a[i] = a[j]; a[j] = t;
}
public static void print(int a[]) {
for (int i = 0; i < a.length; i++)
StdOut.print(a[i] + " ");
StdOut.println();
}
public static void main(String[] args) {
int[] a = In.readInts(args[0]);
sort(a);
print(a);
}
}