https://blog.youkuaiyun.com/beyondzd2000zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/beyondzd2000/article/details/137345609https://blog.youkuaiyun.com/beyondzd2000/article/details/137345609beyondzd2000Wed, 03 Apr 2024 14:49:18 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/105047337https://blog.youkuaiyun.com/beyondzd2000/article/details/105047337beyondzd2000Mon, 23 Mar 2020 14:00:22 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/83661880https://blog.youkuaiyun.com/beyondzd2000/article/details/83661880beyondzd2000Fri, 02 Nov 2018 21:33:58 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/61422703https://blog.youkuaiyun.com/beyondzd2000/article/details/61422703beyondzd2000Sat, 11 Mar 2017 18:21:19 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/50443522https://blog.youkuaiyun.com/beyondzd2000/article/details/50443522beyondzd2000Thu, 31 Dec 2015 20:10:04 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/44962119https://blog.youkuaiyun.com/beyondzd2000/article/details/44962119beyondzd2000Thu, 09 Apr 2015 16:54:52 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/15507173https://blog.youkuaiyun.com/beyondzd2000/article/details/15507173beyondzd2000Tue, 12 Nov 2013 19:11:12 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7841046https://blog.youkuaiyun.com/beyondzd2000/article/details/7841046beyondzd2000Wed, 30 Jan 2013 23:02:19 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/8024822https://blog.youkuaiyun.com/beyondzd2000/article/details/8024822beyondzd2000Thu, 27 Sep 2012 14:36:53 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/8007325https://blog.youkuaiyun.com/beyondzd2000/article/details/8007325beyondzd2000Sat, 22 Sep 2012 14:42:45 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7910252https://blog.youkuaiyun.com/beyondzd2000/article/details/7910252beyondzd2000Sun, 26 Aug 2012 23:14:29 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/6410646https://blog.youkuaiyun.com/beyondzd2000/article/details/6410646beyondzd2000Tue, 07 Aug 2012 22:08:55 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/6598588https://blog.youkuaiyun.com/beyondzd2000/article/details/6598588beyondzd2000Tue, 07 Aug 2012 22:08:32 +0800=2] 个数已经是排好顺序的，现在要把第n个数插到前面的有序数中，使得这n个数也是排好顺序的。如此反复循环，直到全部排好顺序。直接插入排序是稳定的。算法时间复杂度O(n2)。 void InsertSort(int array[], int length) { 　　　 int i, j, key;]]>https://blog.youkuaiyun.com/beyondzd2000/article/details/7701034https://blog.youkuaiyun.com/beyondzd2000/article/details/7701034beyondzd2000Thu, 28 Jun 2012 23:32:32 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7689941https://blog.youkuaiyun.com/beyondzd2000/article/details/7689941beyondzd2000Mon, 25 Jun 2012 14:55:56 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7568217https://blog.youkuaiyun.com/beyondzd2000/article/details/7568217beyondzd2000Tue, 15 May 2012 12:40:32 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7447696https://blog.youkuaiyun.com/beyondzd2000/article/details/7447696beyondzd2000Tue, 10 Apr 2012 23:39:54 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7433540https://blog.youkuaiyun.com/beyondzd2000/article/details/7433540beyondzd2000Fri, 06 Apr 2012 19:57:53 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/7101912https://blog.youkuaiyun.com/beyondzd2000/article/details/7101912beyondzd2000Sun, 25 Dec 2011 23:06:33 +0800https://blog.youkuaiyun.com/beyondzd2000/article/details/6416061https://blog.youkuaiyun.com/beyondzd2000/article/details/6416061beyondzd2000Thu, 12 May 2011 23:47:00 +0800