﻿<?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>博客园-Solo's Tech Space-随笔分类-DataStructure</title><link>http://www.cnblogs.com/fancystyle/category/80712.html</link><description>人類的全部才能無非是時間和耐心的混合物 </description><language>zh-cn</language><lastBuildDate>Sat, 17 May 2008 19:19:32 GMT</lastBuildDate><pubDate>Sat, 17 May 2008 19:19:32 GMT</pubDate><ttl>60</ttl><item><title>递归-裴波那契数列 </title><link>http://www.cnblogs.com/solo/archive/2008/02/02/1061526.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sat, 02 Feb 2008 10:18:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2008/02/02/1061526.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/1061526.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2008/02/02/1061526.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/1061526.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/1061526.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 裴波那契数列 &nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2008/02/02/1061526.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/1061526.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2008-02-02 18:18 <a href="http://www.cnblogs.com/solo/archive/2008/02/02/1061526.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归-斐波那契(母牛生小牛问题)</title><link>http://www.cnblogs.com/solo/archive/2008/02/02/1062465.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sat, 02 Feb 2008 10:18:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2008/02/02/1062465.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/1062465.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2008/02/02/1062465.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/1062465.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/1062465.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题:<br><br>   若一头小母牛，从出生起第四个年头开始每年生一头母牛，按此规律，第n年有多少头母牛？&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2008/02/02/1062465.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/1062465.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2008-02-02 18:18 <a href="http://www.cnblogs.com/solo/archive/2008/02/02/1062465.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归-八皇后/N皇后问题</title><link>http://www.cnblogs.com/solo/archive/2008/02/02/1062858.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sat, 02 Feb 2008 10:18:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2008/02/02/1062858.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/1062858.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2008/02/02/1062858.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/1062858.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/1062858.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。<br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2008/02/02/1062858.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/1062858.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2008-02-02 18:18 <a href="http://www.cnblogs.com/solo/archive/2008/02/02/1062858.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>快速排序(C#数据结构学习十)</title><link>http://www.cnblogs.com/solo/archive/2007/01/02/610139.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Tue, 02 Jan 2007 10:48:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2007/01/02/610139.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/610139.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2007/01/02/610139.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/610139.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/610139.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: using&nbsp;System;using&nbsp;System.Collections.Generic;using&nbsp;System.Text;namespace&nbsp;SoloDa...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2007/01/02/610139.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/610139.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2007-01-02 18:48 <a href="http://www.cnblogs.com/solo/archive/2007/01/02/610139.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>冒泡排序(C#数据结构学习九)</title><link>http://www.cnblogs.com/solo/archive/2007/01/02/610138.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Tue, 02 Jan 2007 10:47:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2007/01/02/610138.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/610138.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2007/01/02/610138.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/610138.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/610138.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: using&nbsp;System;using&nbsp;System.Collections.Generic;using&nbsp;System.Text;namespace&nbsp;SoloDa...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2007/01/02/610138.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/610138.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2007-01-02 18:47 <a href="http://www.cnblogs.com/solo/archive/2007/01/02/610138.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>希尔排序(C#数据结构学习八)</title><link>http://www.cnblogs.com/solo/archive/2007/01/01/609674.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Mon, 01 Jan 2007 12:40:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2007/01/01/609674.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/609674.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2007/01/01/609674.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/609674.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/609674.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;using&nbsp;System;using&nbsp;System.Collections.Generic;using&nbsp;System.Text;namespace&nbs...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2007/01/01/609674.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/609674.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2007-01-01 20:40 <a href="http://www.cnblogs.com/solo/archive/2007/01/01/609674.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>插入排序(C#数据结构学习七)</title><link>http://www.cnblogs.com/solo/archive/2007/01/01/609673.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Mon, 01 Jan 2007 12:37:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2007/01/01/609673.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/609673.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2007/01/01/609673.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/609673.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/609673.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: using&nbsp;System;using&nbsp;System.Collections.Generic;using&nbsp;System.Text;namespace&nbsp;SoloDa...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2007/01/01/609673.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/609673.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2007-01-01 20:37 <a href="http://www.cnblogs.com/solo/archive/2007/01/01/609673.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>折半查找(C#数据结构学习六)</title><link>http://www.cnblogs.com/solo/archive/2006/12/21/599648.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Thu, 21 Dec 2006 11:49:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/21/599648.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/599648.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/21/599648.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/599648.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/599648.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;3using&nbsp;System.Text;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/21/599648.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/599648.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-21 19:49 <a href="http://www.cnblogs.com/solo/archive/2006/12/21/599648.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[ZT]线索二叉树(C#数据结构五)</title><link>http://www.cnblogs.com/solo/archive/2006/12/21/599646.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Thu, 21 Dec 2006 11:46:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/21/599646.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/599646.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/21/599646.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/599646.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/599646.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2&nbsp;&nbsp;3namespace&nbsp;BiThrTree&nbsp;&nbsp;4{&nbsp...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/21/599646.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/599646.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-21 19:46 <a href="http://www.cnblogs.com/solo/archive/2006/12/21/599646.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>队列(C#数据结构学习三)</title><link>http://www.cnblogs.com/solo/archive/2006/12/19/596800.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Tue, 19 Dec 2006 06:23:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/19/596800.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/596800.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/19/596800.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/596800.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/596800.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;3using&nbsp;System.Text;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/19/596800.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/596800.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-19 14:23 <a href="http://www.cnblogs.com/solo/archive/2006/12/19/596800.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二叉树(C#数据结构四)</title><link>http://www.cnblogs.com/solo/archive/2006/12/19/596792.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Tue, 19 Dec 2006 06:19:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/19/596792.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/596792.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/19/596792.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/596792.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/596792.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections;&nbsp;&nbsp;3using...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/19/596792.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/596792.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-19 14:19 <a href="http://www.cnblogs.com/solo/archive/2006/12/19/596792.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>栈(C#数据结构学习二)</title><link>http://www.cnblogs.com/solo/archive/2006/12/17/594840.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sun, 17 Dec 2006 09:06:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/17/594840.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/594840.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/17/594840.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/594840.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/594840.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.Collections;&nbsp;3using&nbsp;System.Colle...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/17/594840.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/594840.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-17 17:06 <a href="http://www.cnblogs.com/solo/archive/2006/12/17/594840.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>无聊用C#2.0泛型实现的链表(C#数据结构一)</title><link>http://www.cnblogs.com/solo/archive/2006/12/16/594375.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sat, 16 Dec 2006 12:38:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/16/594375.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/594375.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/16/594375.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/594375.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/594375.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections;&nbsp;&nbsp;3using&nbsp;Sy...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/16/594375.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/594375.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-16 20:38 <a href="http://www.cnblogs.com/solo/archive/2006/12/16/594375.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[zT]一个高效的递归 C# 树算法（TreeView呈现）</title><link>http://www.cnblogs.com/solo/archive/2006/12/10/587835.html</link><dc:creator>Solog</dc:creator><author>Solog</author><pubDate>Sun, 10 Dec 2006 03:35:00 GMT</pubDate><guid>http://www.cnblogs.com/solo/archive/2006/12/10/587835.html</guid><wfw:comment>http://www.cnblogs.com/solo/comments/587835.html</wfw:comment><comments>http://www.cnblogs.com/solo/archive/2006/12/10/587835.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/solo/comments/commentRss/587835.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/solo/services/trackbacks/587835.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个高效的递归C#树算法（TreeView呈现）树形数据结构createtabletreetable(idintidentity(1,1)notnull,...&nbsp;&nbsp;<a href='http://www.cnblogs.com/solo/archive/2006/12/10/587835.html'>阅读全文</a><img src ="http://www.cnblogs.com/solo/aggbug/587835.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://solo.cnblogs.com/" target="_blank">Solog</a> 2006-12-10 11:35 <a href="http://www.cnblogs.com/solo/archive/2006/12/10/587835.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>