用Java泛型实现2-路插入排序

package ch10;

/**
 * 2-路插入排序
 * @author songjie
 *
 */
public class TwoWayInsertSort {
	/**
	 * 
	 * @param <T>
	 * @param t：原始数组
	 * @param s:待返回的排好序的数组
	 * @return
	 * @throws IllegalArgumentException
	 */
	public static <T extends Comparable> boolean twoWayInsertSort(T[] t, T[] s) throws IllegalArgumentException{
		if(t==null || t.length<=1) return true;//安全性检查
		if(s==null || s.length!=t.length) throw new IllegalArgumentException("参数传递不正确-两个数组的长度不一样！");
		
		s[0] = t[0];
		int first = 0;
		int end = 0;
		for(int i=1 ; i<=t.length-1 ; i++){
			if(t[i].compareTo(s[0]) > 0){//插到后面
				int j;
				for(j=end; j>0 && s[j].compareTo(t[i])>0 ;j--){
					s[j+1] = s[j];
				}
				s[j+1] = t[i];
				end++;
			}else{//插到前面
				if(first == 0){
					first = s.length-1;
					s[first] = t[i];
					continue;
				}
				int k;
				for(k = first; k<=s.length-1 && s[k].compareTo(t[i])<=0 ; k++){
					s[k-1] = s[k];
				}
				s[k-1] = t[i];
				first--;
			}
		}
		
		return true;
	}
	
	public static void main(String[] args) {
		Integer[] arr = new Integer[]{7,4,3,1,6,9,8};
		Integer[] arrSort = new Integer[arr.length];
		TwoWayInsertSort.twoWayInsertSort(arr, arrSort);
		for(int i : arrSort){
			System.out.println(i);
		}
	}
}