?? ??? ??: java ??? ????

?? ??: ??? ? ?? ???? ???? ?? ??? ??? ? ??? ???? ?? ??? ?????.

static?int[]?insertSort(int[]?array){
????????int?len?=?array.length;
????????for?(int?begin?=?1;?begin?< len; begin++){
            int cur = begin;
            while (cur >?0?&&?array[cur]?< array[cur-1]){
                int tmp = array[cur];
                array[cur] = array[cur-1];
                array[cur-1] = tmp;
                cur--;
            }
        }
        return array;
    }

???? ? ?? ??: ??? ? ?? ???? ?????. ?? ??? ??? ? ??? ???? cur? ???? ??? ???? ??? ?? ??? ?? ??? ?? ?????. ?? ??. ?? cur? ???? ??? ??? ??? ??? ????.

    static int[] insertSort2(int[] array){
        int len = array.length;
        for (int begin = 1; begin < len; begin++){
            int cur = begin;
            int tmp = array[cur];
            while (cur >?0?&&?array[cur]?< array[cur-1]){
                array[cur] = array[cur-1];
                cur--;
            }
            array[cur] = tmp;
        }
        return array;
    }

2?? ???

? ?? ????? ????? ? ?? ????? ?????. ??? ? ?? ????? ??? ??? ?? ??? ?????. ?? ??? ?? ??, ? cmp ?? ??? ??? swap ?? ??? ????. ?? ??? ???? ? ??? ?? ???? ?? ? ???? ???? ?????.

static int[] insertSort3(int[] array){
        int len = array.length;

        for (int begin = 1; begin < len; begin++){
            int v = array[begin];
            int insertIndex = search(array,begin);
            // 將 [insertIndex, begin) 范圍內(nèi)的元素往右邊挪動一個單位
            for (int i = begin; i >?insertIndex;?i--){
????????????????array[i]?=?array[i-1];
????????????}
????????????array[insertIndex]?=?v;
????????}
????????return?array;
????}
????static?int?search(int[]?array,?int?index){
????????int?begin?=?0;
????????int?end?=?index;
????????while(begin?< end){
            int mid = (begin+end) >>?1;
????????????if?(array[index]?< array[mid]){
                end = mid;
            }else{
                begin = mid+1;
            }
        }
        return begin;
    }

?? ??? ??? ??? ?? ??? ????? ?? ??? ?? ?? ???? ??? O(n^2)

?? ?? ?? ??:

    package com.mj.sort.cmp;import com.mj.sort.Sort;public class InsertionSort3<T extends Comparable<T>>?extends?Sort<T>?{

	//	protected?void?sort()?{//		for?(int?begin?=?1;?begin?< array.length; begin++) {//			T v = array[begin];//			int insertIndex = search(begin);//			// 將 [insertIndex, begin) 范圍內(nèi)的元素往右邊挪動一個單位			for (int i = begin - 1; i >=?insertIndex;?i--)?{							}//			for?(int?i?=?begin;?i?>?insertIndex;?i--)?{//				array[i]?=?array[i?-?1];//			}//			array[insertIndex]?=?v;//		}//	}
	
	@Override
	protected?void?sort()?{
		for?(int?begin?=?1;?begin?< array.length; begin++) {
			insert(begin, search(begin));	//元素索引給你，你告訴這個位置的元素往哪插
		} 
	}
	
	/**
	 * 將source位置的元素插入到dest位置
	 * @param source
	 * @param dest
	 */
	private void insert(int source, int dest) {
		T v = array[source];
		for (int i = source; i >?dest;?i--)?{
			array[i]?=?array[i?-?1];
		}
		array[dest]?=?v;
	}
	
	/**
	?*?利用二分搜索找到?index?位置元素的待插入位置
	?*?已經(jīng)排好序數(shù)組的區(qū)間范圍是?[0,?index)
	?*?@param?index
	?*?@return
	?*/
	private?int?search(int?index)?{
		int?begin?=?0;
		int?end?=?index;
		while?(begin?< end) {
			int mid = (begin + end) >>?1;
			if?(cmp(array[index],?array[mid])?<?0)?{
				end?=?mid;
			}?else?{
				begin?=?mid?+?1;
			}
		}
		return?begin;
	}}

?? ?? ??: java ?? ????

? ??? Java?? ?? ??? ??? ? ??? ????? ??? ?? ?????. ??? ??? PHP ??? ????? ?? ?? ??? ?????!