﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-展翅飞翔-随笔分类-j2se类</title><link>http://www.blogjava.net/loyalgl/category/47368.html</link><description>实现解读客户思想与架构现有最成熟技术的完美融合</description><language>zh-cn</language><lastBuildDate>Wed, 15 Dec 2010 02:14:05 GMT</lastBuildDate><pubDate>Wed, 15 Dec 2010 02:14:05 GMT</pubDate><ttl>60</ttl><item><title>【原】算法：冒泡排序+0后置算法</title><link>http://www.blogjava.net/loyalgl/archive/2009/11/24/303469.html</link><dc:creator>龙樱</dc:creator><author>龙樱</author><pubDate>Tue, 24 Nov 2009 06:15:00 GMT</pubDate><guid>http://www.blogjava.net/loyalgl/archive/2009/11/24/303469.html</guid><wfw:comment>http://www.blogjava.net/loyalgl/comments/303469.html</wfw:comment><comments>http://www.blogjava.net/loyalgl/archive/2009/11/24/303469.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/loyalgl/comments/commentRss/303469.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/loyalgl/services/trackbacks/303469.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本为介绍了冒泡算法及其扩展0后置的排序方法，相信对于初学算法的朋友们会有所帮助&nbsp;&nbsp;<a href='http://www.blogjava.net/loyalgl/archive/2009/11/24/303469.html'>阅读全文</a><img src ="http://www.blogjava.net/loyalgl/aggbug/303469.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/loyalgl/" target="_blank">龙樱</a> 2009-11-24 14:15 <a href="http://www.blogjava.net/loyalgl/archive/2009/11/24/303469.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>