算法思路
private static void InsertSort(List<int> list) { for (int i = 1; i < list.Count; i++) { int inservalue = list[i]; int insertindex = i - 1; while (insertindex >= 0 && inservalue < list[insertindex]) { list[insertindex + 1] = list[insertindex]; insertindex--; } list[insertindex + 1] = inservalue; } }
http://www.cnblogs.com/weiios/p/3933985.html
原文:http://www.cnblogs.com/tianciliangen/p/7489057.html