直接插入排序

/**
 * 排序接口类
 * Created by zhouyh on 2018/5/25.
 */
public abstract class ISort {
    public abstract int[] sort(int[] array);
}

/**
 * 直接插入排序
 * Created by zhouyh on 2018/5/25.
 */
public class DirectInsertSort extends ISort {
    @Override
    public int[] sort(int[] array) {
        int tmp;
        for (int i=1; i<array.length; i++){
            tmp = array[i]; //array[i]的拷贝
            //如果右侧无序区第一个元素array[i] < array[i-1]小于左侧有序区最后一个元素
            //需要将左侧有序区比array[i]大的元素后移
            if (array[i] < array[i-1]){
                int j = i-1;
                while (j>=0 && tmp<array[j]){
                    array[j+1] = array[j];
                    j--;
                }
                array[j+1] = tmp;
            }
        }
        return array;
    }
}

def dirInsertSort(reList):
    length = len(reList)
    for i in range(1, length):
        for j in range(i):
            if reList[i] < reList[j]:
                reList.insert(j, reList[i])
                reList.pop(i+1)
                break
    return reList

relist = [1, 23, 12, 7, 34, 10, 51]

print(dirInsertSort(relist))