语源科技BlogJava-Cafe's Bloghttp://www.blogjava.net/cafe/我的咖啡屋zh-cnSun, 12 Apr 2026 07:52:25 GMTSun, 12 Apr 2026 07:52:25 GMT60asdfasdfasdfasfdsadfhttp://www.blogjava.net/cafe/archive/2007/05/07/115760.html我的咖啡屋我的咖啡屋Mon, 07 May 2007 14:00:00 GMThttp://www.blogjava.net/cafe/archive/2007/05/07/115760.htmlhttp://www.blogjava.net/cafe/comments/115760.htmlhttp://www.blogjava.net/cafe/archive/2007/05/07/115760.html#Feedback1http://www.blogjava.net/cafe/comments/commentRss/115760.htmlhttp://www.blogjava.net/cafe/services/trackbacks/115760.html

我的咖啡屋 2007-05-07 22:00 发表评论
]]>插入排序-->学习笔记1http://www.blogjava.net/cafe/archive/2007/04/18/111666.html我的咖啡屋我的咖啡屋Wed, 18 Apr 2007 08:16:00 GMThttp://www.blogjava.net/cafe/archive/2007/04/18/111666.htmlhttp://www.blogjava.net/cafe/comments/111666.htmlhttp://www.blogjava.net/cafe/archive/2007/04/18/111666.html#Feedback2http://www.blogjava.net/cafe/comments/commentRss/111666.htmlhttp://www.blogjava.net/cafe/services/trackbacks/111666.html 1int num[] = {5,2,4,6,1,3};
 2        int i = 0;
 3        for(int j = 1; j < num.length;j++) {
 4            int key = num[j];
 5            i = j - 1;
 6            while (i >= 0 && num[i] > key) {
 7                num[i+1] = num[i];
 8                i=i-1;
 9            }
10            num[i+1]=key;
11        }
12        for(int j = 0; j < num.length;j++) {
13            System.out.print(num[j]);
14        }

我的咖啡屋 2007-04-18 16:16 发表评论
]]>