package OEU.LYG4DQS4D; import PEU.P.time.*; //第二代罗瑶光小高峰平均高峰过滤快排思想设计中。小高峰高峰过滤快速排序 public class Quick_6D_luoyaoguang_Sort{ public int[] sort(int[] a) { TimeCheck imeCheck= new TimeCheck(); imeCheck.begin(); quick2ds(a, 0, a.length-1); imeCheck.end(); imeCheck.duration(); return a; } private void quick2ds(int[] a, int lp, int rp) { if(lp < rp){ int c = rp - lp; if(c < 7){ int j; for(int i = 1 + lp; i <= lp + c; i++){ j = i;while(j>=1+lp){ if(a[j]=a[rp]){ x=a[rp]; } while(lp1x){ rp--; } if(lp1=1+lp){ if(Double.valueOf(a[j][1])=Double.valueOf(a[rp][1])){ x=a[rp]; } while(lp1Double.valueOf(x[1])){ rp1--; } if(lp1