??xml version="1.0" encoding="utf-8" standalone="yes"?>在线成人av观看,国产精品久久久久久久久久三级,狠狠久久综合http://www.aygfsteel.com/yangtaochina/宁静淡定zh-cnTue, 17 Jun 2025 22:19:41 GMTTue, 17 Jun 2025 22:19:41 GMT60我的插入排序Q?/title><link>http://www.aygfsteel.com/yangtaochina/archive/2011/03/14/346264.html</link><dc:creator>大道至简</dc:creator><author>大道至简</author><pubDate>Mon, 14 Mar 2011 12:44:00 GMT</pubDate><guid>http://www.aygfsteel.com/yangtaochina/archive/2011/03/14/346264.html</guid><wfw:comment>http://www.aygfsteel.com/yangtaochina/comments/346264.html</wfw:comment><comments>http://www.aygfsteel.com/yangtaochina/archive/2011/03/14/346264.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/yangtaochina/comments/commentRss/346264.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/yangtaochina/services/trackbacks/346264.html</trackback:ping><description><![CDATA[java底功不强Q看了书 Q查了网上的资料自己才写了个插入排序? <div> <div style="background-color: #eeeeee; font-size: 13px; border-left-color: #cccccc; padding-right: 5px; padding-bottom: 4px; padding-left: 4px; padding-top: 4px; width: 98%; word-break: break-all; "><!--<br /> <br /> Code highlighting produced by Actipro CodeHighlighter (freeware)<br /> http://www.CodeHighlighter.com/<br /> <br /> --><span style="color: #0000FF; ">package</span><span style="color: #000000; "> com.yangtao.file;<br /> <br /> </span><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">class</span><span style="color: #000000; "> InsertSort {<br /> <br />     </span><span style="color: #008000; ">/**</span><span style="color: #008000; "><br />      * </span><span style="color: #808080; ">@param</span><span style="color: #008000; "> args<br />      </span><span style="color: #008000; ">*/</span><span style="color: #000000; "><br />     </span><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">static</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">void</span><span style="color: #000000; "> main(String[] args) {<br />         InsertSort insertSort </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> InsertSort();<br />         </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] a </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">new</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[]{</span><span style="color: #000000; ">5</span><span style="color: #000000; ">,</span><span style="color: #000000; ">2</span><span style="color: #000000; ">,</span><span style="color: #000000; ">7</span><span style="color: #000000; ">,</span><span style="color: #000000; ">1</span><span style="color: #000000; ">,</span><span style="color: #000000; ">6</span><span style="color: #000000; ">,</span><span style="color: #000000; ">9</span><span style="color: #000000; ">};<br />         </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] b </span><span style="color: #000000; ">=</span><span style="color: #000000; "> insertSort.sort(a);<br />         </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i </span><span style="color: #000000; "><</span><span style="color: #000000; "> b.length; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br />             System.out.println(b[i]);<br />         }<br />     }<br />     <br />     </span><span style="color: #008000; ">/**</span><span style="color: #008000; "><br />      * </span><span style="color: #808080; ">@param</span><span style="color: #008000; "> n 要排序的数l?br />      * </span><span style="color: #808080; ">@return</span><span style="color: #008000; "> 排好序后的数l?br />      </span><span style="color: #008000; ">*/</span><span style="color: #000000; "><br />     </span><span style="color: #0000FF; ">public</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] sort(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[] n){<br />         </span><span style="color: #008000; ">//</span><span style="color: #008000; ">从数l下标ؓ1的数l开始?/span><span style="color: #008000; "><br /> </span><span style="color: #000000; ">        </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> j </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">; j </span><span style="color: #000000; "><</span><span style="color: #000000; "> n.length; j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br />             </span><span style="color: #008000; ">//</span><span style="color: #008000; ">取到WJ个元素的倹{?/span><span style="color: #008000; "><br /> </span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> key </span><span style="color: #000000; ">=</span><span style="color: #000000; "> n[j];<br />             </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> j </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">用i表示排序前的一个下?br />             </span><span style="color: #008000; ">//</span><span style="color: #008000; ">如果前面q有数据 而且前面一个数大于后面一个数Q我们交换位|?/span><span style="color: #008000; "><br /> </span><span style="color: #000000; ">            </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; "> </span><span style="color: #000000; ">&&</span><span style="color: #000000; "> n[i] </span><span style="color: #000000; ">></span><span style="color: #000000; "> key){<br />                 n[i </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> n[i];<br />                 i</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;<br />             }<br />             n[i </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> key;<br />         }<br />         </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> n;<br />     }<br /> <br /> }<br /> </span></div> </div> <img src ="http://www.aygfsteel.com/yangtaochina/aggbug/346264.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/yangtaochina/" target="_blank">大道至简</a> 2011-03-14 20:44 <a href="http://www.aygfsteel.com/yangtaochina/archive/2011/03/14/346264.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>成都东西好贵?/title><link>http://www.aygfsteel.com/yangtaochina/archive/2010/07/19/326572.html</link><dc:creator>大道至简</dc:creator><author>大道至简</author><pubDate>Mon, 19 Jul 2010 13:51:00 GMT</pubDate><guid>http://www.aygfsteel.com/yangtaochina/archive/2010/07/19/326572.html</guid><wfw:comment>http://www.aygfsteel.com/yangtaochina/comments/326572.html</wfw:comment><comments>http://www.aygfsteel.com/yangtaochina/archive/2010/07/19/326572.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/yangtaochina/comments/commentRss/326572.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/yangtaochina/services/trackbacks/326572.html</trackback:ping><description><![CDATA[<span id="wmqeeuq" class="Apple-tab-span" style="white-space:pre"> </span>很久没吃蛋了,今天M点蛋和米.我就随便选了一袋米和一盒蛋居然要了?0?那个心痛呀! <img src ="http://www.aygfsteel.com/yangtaochina/aggbug/326572.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/yangtaochina/" target="_blank">大道至简</a> 2010-07-19 21:51 <a href="http://www.aygfsteel.com/yangtaochina/archive/2010/07/19/326572.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>q求的是什?/title><link>http://www.aygfsteel.com/yangtaochina/archive/2010/06/06/322901.html</link><dc:creator>大道至简</dc:creator><author>大道至简</author><pubDate>Sun, 06 Jun 2010 12:17:00 GMT</pubDate><guid>http://www.aygfsteel.com/yangtaochina/archive/2010/06/06/322901.html</guid><wfw:comment>http://www.aygfsteel.com/yangtaochina/comments/322901.html</wfw:comment><comments>http://www.aygfsteel.com/yangtaochina/archive/2010/06/06/322901.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/yangtaochina/comments/commentRss/322901.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/yangtaochina/services/trackbacks/322901.html</trackback:ping><description><![CDATA[<span id="wmqeeuq" class="Apple-tab-span" style="white-space:pre"> </span>作ؓ一个程序员Q要学的东西旉常多的,大家都希望自q技术能在短旉内成Z什么牛人,于是在干q开始之前学习的热情挺高的。当要学习的东西非常多的时候常常感到力不从心。于是该攑ּ的放弃了Q该抱怨的开始抱怨了。最l我们ؓ自己扑ր口扄pq样不好那样不好。不学了Q这是典型的与自己赌气。我们在学习q程中忘C我们真正需要是什么。要成ؓ什么样的h。我原来也是q样的,不过现在才明白过来。原来在看这些大道理的时候,自己都是莞尔一W,心想自己怎么可能成ؓ那种人啦Q其实不知不觉就已经成ؓ那种Z? <div>说个单点的例子,也是亲生体会哈,一开始对自己喜欢的h都是一个模p的概述Q比如希望以后长的漂亮,大大的眼睛,常常的头发,看v来比较温柔,于是我就照着q样的标准去找h。在某一天终于找到这L一个hQ默默的喜欢她,没有q她。等自己惌ҎQ她已经有男朋友了。这时心里别提多难过了。以后的几个月时间过的都是昏昏沉沉的Q而且情A极不E_。今天突然明白,原来她只是类的一个实例而已Q类q可以在new新的实例。h生也可能是q样很容易自己就把自qq住了?/div> <img src ="http://www.aygfsteel.com/yangtaochina/aggbug/322901.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/yangtaochina/" target="_blank">大道至简</a> 2010-06-06 20:17 <a href="http://www.aygfsteel.com/yangtaochina/archive/2010/06/06/322901.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>W一ơ拿到工?/title><link>http://www.aygfsteel.com/yangtaochina/archive/2010/06/05/322818.html</link><dc:creator>大道至简</dc:creator><author>大道至简</author><pubDate>Sat, 05 Jun 2010 01:24:00 GMT</pubDate><guid>http://www.aygfsteel.com/yangtaochina/archive/2010/06/05/322818.html</guid><wfw:comment>http://www.aygfsteel.com/yangtaochina/comments/322818.html</wfw:comment><comments>http://www.aygfsteel.com/yangtaochina/archive/2010/06/05/322818.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/yangtaochina/comments/commentRss/322818.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/yangtaochina/services/trackbacks/322818.html</trackback:ping><description><![CDATA[<span id="wmqeeuq" class="Apple-tab-span" style="white-space:pre"> </span>在外面؜了两个多月了Q在前几家公司要么是我看不上人家自己C没工资,要么是h家看不上我,被炒了没工资Q今天早上凌晨拿到属于自q工资Q感觉还不错Q虽然比较少Q但是还是拿C。这下要{到下个月才能拿到工资了Q奋斗!Q! <img src ="http://www.aygfsteel.com/yangtaochina/aggbug/322818.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/yangtaochina/" target="_blank">大道至简</a> 2010-06-05 09:24 <a href="http://www.aygfsteel.com/yangtaochina/archive/2010/06/05/322818.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>你比研究生强么?http://www.aygfsteel.com/yangtaochina/archive/2010/06/04/322809.html大道至简大道至简Fri, 04 Jun 2010 15:08:00 GMThttp://www.aygfsteel.com/yangtaochina/archive/2010/06/04/322809.htmlhttp://www.aygfsteel.com/yangtaochina/comments/322809.htmlhttp://www.aygfsteel.com/yangtaochina/archive/2010/06/04/322809.html#Feedback1http://www.aygfsteel.com/yangtaochina/comments/commentRss/322809.htmlhttp://www.aygfsteel.com/yangtaochina/services/trackbacks/322809.html 最q老是被打击,现在打击的我都没什么感觉了。都L了。不是其他的什么被打击Q感情这关难q呀。喜Ƣ谁谁就有男朋友了,相当郁闷。今天上译֐人家说某某有h友了Q一打听q是个研I生。我也顺便看了看涨的不是很帅Q也不是很丑。很qx化得一个hQ带个眼镜。我当时啊,哪个心呀Q简直是痛的没感觉了。我一个大专生而且是成教的Q都不能是大专生,人家是研I生。这个差距实在是太大了。我也没什么资格和人家M。不q我怿我杨某绝对不会比研究生差Q杨某要成就一d事,让自p得自׃不v的h汗颜。我q不信就比你研究生差?

大道至简 2010-06-04 23:08 发表评论
]]>
初出江湖Q吃饭成问题http://www.aygfsteel.com/yangtaochina/archive/2010/06/03/322658.html大道至简大道至简Thu, 03 Jun 2010 11:37:00 GMThttp://www.aygfsteel.com/yangtaochina/archive/2010/06/03/322658.htmlhttp://www.aygfsteel.com/yangtaochina/comments/322658.htmlhttp://www.aygfsteel.com/yangtaochina/archive/2010/06/03/322658.html#Feedback0http://www.aygfsteel.com/yangtaochina/comments/commentRss/322658.htmlhttp://www.aygfsteel.com/yangtaochina/services/trackbacks/322658.html 我从学校出来了,q个曄是想的很好的事情,现在看看Q其实很D酷。既然从学校出来了就不能在向安要钱了。再要钱岂不是很丢h。现在我吃饭都成问题了,外面吃饭不仅很贵Q而且吃不饱,x以前在家里每K剩饭Q现在想L是惭愧呀。现在才能体会到父母对自q好。哎努力奋斗吧!Q我怿q样的日子应该不ѝ加沏V?

大道至简 2010-06-03 19:37 发表评论
]]>
如何d好友http://www.aygfsteel.com/yangtaochina/archive/2010/04/24/319281.html大道至简大道至简Sat, 24 Apr 2010 11:46:00 GMThttp://www.aygfsteel.com/yangtaochina/archive/2010/04/24/319281.htmlhttp://www.aygfsteel.com/yangtaochina/comments/319281.htmlhttp://www.aygfsteel.com/yangtaochina/archive/2010/04/24/319281.html#Feedback0http://www.aygfsteel.com/yangtaochina/comments/commentRss/319281.htmlhttp://www.aygfsteel.com/yangtaochina/services/trackbacks/319281.html q个里面q不知道是如何添加好友的

大道至简 2010-04-24 19:46 发表评论
]]>
վ֩ģ壺 | | ɽ| | | ƽ| | | ƽ| | | | | ͼ| | | Ǩ| | ٹ| | | | ̨| | | µ| | Ȫ| ˮ| ֦| ɽ| | | Դ| | | | ׼| | | |