http://blog.csdn.net/l_xiaodao/扎根于基础，技术是第一生产力zh-CNThu, 10 Aug 2006 13:26:08 GMT60L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045861.aspxThu, 10 Aug 2006 13:26:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045861.aspxhttp://blog.csdn.net/l_xiaodao/comments/1045861.aspxhttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045861.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/1045861.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1045861关于模式Template Method与Strategy模式的一点见解<img src ="http://blog.csdn.net/l_xiaodao/aggbug/1045861.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045786.aspxThu, 10 Aug 2006 13:13:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045786.aspxhttp://blog.csdn.net/l_xiaodao/comments/1045786.aspxhttp://blog.csdn.net/L_xiaodao/archive/2006/08/10/1045786.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/1045786.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1045786关于Strategy设计模式与Template Method模式的一点见解<img src ="http://blog.csdn.net/l_xiaodao/aggbug/1045786.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2006/01/05/571192.aspxThu, 05 Jan 2006 14:39:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2006/01/05/571192.aspxhttp://blog.csdn.net/l_xiaodao/comments/571192.aspxhttp://blog.csdn.net/L_xiaodao/archive/2006/01/05/571192.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/571192.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=571192 此文简要分析了jdk中的排序算法和快速算法原理和效率。请把此文与快速元算法一文一起观察。 <img src ="http://blog.csdn.net/l_xiaodao/aggbug/571192.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/12/13/551762.aspxTue, 13 Dec 2005 23:44:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/12/13/551762.aspxhttp://blog.csdn.net/l_xiaodao/comments/551762.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/12/13/551762.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/551762.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=551762聚类运算基本实现,假设有n个二维点(x,y),把这n个点分割成m*m个格子.如m=4,即16个格子. 取出10个点,这些点在格子范围内,每个格子只取一次.<img src ="http://blog.csdn.net/l_xiaodao/aggbug/551762.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541240.aspxThu, 01 Dec 2005 15:28:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541240.aspxhttp://blog.csdn.net/l_xiaodao/comments/541240.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541240.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/541240.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=541240内部类学习笔记<img src ="http://blog.csdn.net/l_xiaodao/aggbug/541240.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541001.aspxThu, 01 Dec 2005 12:06:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541001.aspxhttp://blog.csdn.net/l_xiaodao/comments/541001.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/541001.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/541001.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=541001匿名内部类<img src ="http://blog.csdn.net/l_xiaodao/aggbug/541001.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540842.aspxThu, 01 Dec 2005 10:37:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540842.aspxhttp://blog.csdn.net/l_xiaodao/comments/540842.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540842.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/540842.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=540842二手本本COMPAQ N600C低配使用感想,只针对本人现在试用的本本,可能不具备普遍性.<img src ="http://blog.csdn.net/l_xiaodao/aggbug/540842.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540836.aspxThu, 01 Dec 2005 10:34:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540836.aspxhttp://blog.csdn.net/l_xiaodao/comments/540836.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/12/01/540836.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/540836.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=540836二手本本[COMPAQ N600C低配]试用的一些信息,有购买想法.<img src ="http://blog.csdn.net/l_xiaodao/aggbug/540836.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/11/09/525662.aspxWed, 09 Nov 2005 00:30:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/11/09/525662.aspxhttp://blog.csdn.net/l_xiaodao/comments/525662.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/11/09/525662.aspx#Feedback1http://blog.csdn.net/l_xiaodao/comments/commentRss/525662.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=525662详阅《抵制日货怎么就不伟大了？》有感而不得不发。反击，不是漫骂，是行动，首先要自强不息，振中华民族雄风，拒日货而师夷长技以制夷！！原文地址:http://club.news.sohu.com/newsmain.php?c=100&b=minjian&a=231397&c=100 <img src ="http://blog.csdn.net/l_xiaodao/aggbug/525662.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/07/30/441610.aspxSat, 30 Jul 2005 23:55:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/07/30/441610.aspxhttp://blog.csdn.net/l_xiaodao/comments/441610.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/07/30/441610.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/441610.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=441610快速排序法,数组大小小于30万时，前两个效率与jdk中排序算法相当，第三个方法效率比较低。<img src ="http://blog.csdn.net/l_xiaodao/aggbug/441610.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/07/28/437623.aspxThu, 28 Jul 2005 18:12:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/07/28/437623.aspxhttp://blog.csdn.net/l_xiaodao/comments/437623.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/07/28/437623.aspx#Feedback6http://blog.csdn.net/l_xiaodao/comments/commentRss/437623.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=437623win2000+Tomcat5.0.27+Oracle8.1.7配置连接池,适用tomcat5及以上。推荐使用方法一，简洁方便，为什么不用？<img src ="http://blog.csdn.net/l_xiaodao/aggbug/437623.aspx" width = "1" height = "1" />L_xiaodaohttp://blog.csdn.net/L_xiaodao/archive/2005/07/23/432132.aspxSat, 23 Jul 2005 00:46:00 GMThttp://blog.csdn.net/L_xiaodao/archive/2005/07/23/432132.aspxhttp://blog.csdn.net/l_xiaodao/comments/432132.aspxhttp://blog.csdn.net/L_xiaodao/archive/2005/07/23/432132.aspx#Feedback0http://blog.csdn.net/l_xiaodao/comments/commentRss/432132.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=432132例如String[] strArray={"34","er","ee","23","56","er","34","34"};现在需要统计有多少种字符串，每种有几个(需要记录下来)，最后需要每种个数从大到小排列，并且记录每种占总个数的百分比。实际使用中的数组比较大，需要承受几万到几十万个字符串的排序。<img src ="http://blog.csdn.net/l_xiaodao/aggbug/432132.aspx" width = "1" height = "1" />