插入排序java

/**
 * insertion sort algorithm
 * @author hadoop
 */
public class InsertionSort {

	/**
	 * this method to sort the array with  insertion sort algorithm
	 * @param an array of comparable items
	 * @param left index of  the sub array
	 * @param right index  of the sub array
	 */
	public static void sort(int[] arr, int left, int right) {
		int index;// the index of array to be inserted
		int position;
		for (index = left + 1; index <=right; index++) {
			int value   = arr[index];
			//shift larger values to the right 
			for (position= index-1; position >= left && arr[position] > value; position--)
				arr[position+ 1] = arr[position];
			//insert to the right position 
			arr[position + 1] = value;
		}
	}
	/**
	 * this method to sort the array with  insertion sort algorithm
	 * @param an array of comparable items
	 * @param left index of  the sub array
	 * @param right index  of the sub array
	 */
	public static <T> void sort(T[] arr, int left, int right,
			Comparator<? super T> cmp) {
		int index;// the index of array to be inserted
		int position;
		for (index = left + 1; index <=right; index++) {
			T value   = arr[index];
			//shift larger values to the right 
			for (position= index-1; position >= left && cmp.compare(arr[position], value) > 0; position--)
				arr[position+ 1] = arr[position];
			//insert to the right position 
			arr[position + 1] = value;
		}
	}
	
	public static <T extends Comparable<? super T>> void sort(T[] arr,
			int left, int right) {
		
		int index;// the index of array to be inserted
		int position;
		for (index = left + 1; index <=right; index++) {
			T value   = arr[index];
			//shift larger values to the right 
			for (position= index-1; position >= left && arr[position].compareTo(value)>0; position--)
				arr[position+ 1] = arr[position];
			//insert to the right position 
			arr[position + 1] = value;
		}
	}
	public static <T extends Comparable<? super T>> void sort(List<T> list,
			int left, int right) {
		int index;// the index of array to be inserted
		int position;
		for (index = left + 1; index <=right; index++) {
			T value   = list.get(index);
			//shift larger values to the right 
			for (position= index-1; position >= left &&  list.get(position).compareTo(value)>0; position--)
				list.set(position+1, list.get(position));
			//insert to the right position 
			list.set(position+1, value);
		}
	}
	public static <T> void sort(List<T> list, int left, int right,
			Comparator<? super T> cmp) {
		int index;// the index of array to be inserted
		int position;
		for (index = left + 1; index <=right; index++) {
			T value   = list.get(index);
			//shift larger values to the right 
			for (position= index-1; position >= left && cmp.compare(list.get(position), value)>0; position--)
				list.set(position+1, list.get(position));
			//insert to the right position 
			list.set(position+1, value);
		}
	}
	/**
	 * method to swap references in an list.<br />
	 * 
	 * @param <T>
	 * 
	 * @param arr
	 *            an array of Objects. <br />
	 * @param idx1
	 *            the index of the first element. <br />
	 * @param idx2
	 *            the index of the second element. <br />
	 */
	public static void swap(int[] arr, int idx1, int idx2) {
		if (idx1 != idx2) {
			int temp = arr[idx1];
			arr[idx1] = arr[idx2];
			arr[idx2] = temp;
		}
	}

	/**
	 * method to swap references in an list.<br />
	 * 
	 * @param <T>
	 * 
	 * @param arr
	 *            an array of Objects. <br />
	 * @param idx1
	 *            the index of the first element. <br />
	 * @param idx2
	 *            the index of the second element. <br />
	 */
	public static <T> void swap(List<T> list, int idx1, int idx2) {
		T l = list.get(idx1);
		list.set(idx1, list.get(idx2));
		list.set(idx2, l);
	}

	/**
	 * method to swap references in an array.<br />
	 * 
	 * @param arr
	 *            an array of Objects. <br />
	 * @param idx1
	 *            the index of the first element. <br />
	 * @param idx2
	 *            the index of the second element. <br />
	 */
	public static <T> void swap(T[] arr, int idx1, int idx2) {
		T tmp = arr[idx1];
		arr[idx1] = arr[idx2];
		arr[idx2] = tmp;
	}
}