Java排序算法包 支持自定义比较条件

package sort; import java.util.Comparator; public class QuickSort<T extends Comparable> extends Sort<T>{ public QuickSort(T[] list,Comparator<T> comparator){ super(list,comparator); } public QuickSort(T[] list){ super(list); } @SuppressWarnings({"unused","unchecked"}) private boolean isAfter(T a,T b){ if(comparator==null){ return a.compareTo(b)>0?true:false; }else{ if( comparator.compare(a, b)>0) return true; else return false; } } @SuppressWarnings({"unused","unchecked"}) private boolean isEqual(T a,T b){ return a.compareTo(b)==0?true:false; } public void sort(){ this.quickSort(0,this.list.length-1); } @SuppressWarnings({"unchecked"}) private void quickSort(int i,int j){ if(j-i<1) return; Object[] equals=new Object[j-i+1]; Object[] temp=new Object[j-i+1]; int equalNum=1; int beforeNum=0; int afterNum=0; int m=i; int a=0; int b=temp.length-1; while(m<j){ if(this.isBefore(list[m],list[j])){ temp[a]=list[m]; beforeNum++; a++; }//else if(this.isAfter(list[m],list[j])){ else if(!this.isBefore(list[m],list[j])){ temp[b]=list[m]; afterNum++; b--; }else{ equals[equalNum]=list[m]; equalNum++; } m++; } for(int k=0;k<equalNum;k++){ temp[a]=list[j]; a++; } for(int t=0;t<temp.length;t++){ this.list[i+t]=(T)temp[t]; } quickSort(i,i+beforeNum-1); quickSort(j-afterNum+1,j); } }