﻿<?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>博客园-史蒂芬的技术博客-随笔分类-算法和数据结构</title><link>http://www.cnblogs.com/dc10101/category/80709.html</link><description>We see potential</description><language>zh-cn</language><lastBuildDate>Mon, 14 Jul 2008 15:19:21 GMT</lastBuildDate><pubDate>Mon, 14 Jul 2008 15:19:21 GMT</pubDate><ttl>60</ttl><item><title>线性表</title><link>http://www.cnblogs.com/dc10101/archive/2008/07/04/1235192.html</link><dc:creator>董超</dc:creator><author>董超</author><pubDate>Thu, 03 Jul 2008 16:56:00 GMT</pubDate><guid>http://www.cnblogs.com/dc10101/archive/2008/07/04/1235192.html</guid><wfw:comment>http://www.cnblogs.com/dc10101/comments/1235192.html</wfw:comment><comments>http://www.cnblogs.com/dc10101/archive/2008/07/04/1235192.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/dc10101/comments/commentRss/1235192.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/dc10101/services/trackbacks/1235192.html</trackback:ping><description><![CDATA[摘要: 目录(*)数组的排序复杂度O(n*n)的有selectionsortbubblesortranksort下面对这三种算法进行讲解：selectionsor...&nbsp;&nbsp;<a href='http://www.cnblogs.com/dc10101/archive/2008/07/04/1235192.html'>阅读全文</a><img src ="http://www.cnblogs.com/dc10101/aggbug/1235192.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归</title><link>http://www.cnblogs.com/dc10101/archive/2008/06/29/1232082.html</link><dc:creator>董超</dc:creator><author>董超</author><pubDate>Sun, 29 Jun 2008 10:57:00 GMT</pubDate><guid>http://www.cnblogs.com/dc10101/archive/2008/06/29/1232082.html</guid><wfw:comment>http://www.cnblogs.com/dc10101/comments/1232082.html</wfw:comment><comments>http://www.cnblogs.com/dc10101/archive/2008/06/29/1232082.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/dc10101/comments/commentRss/1232082.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/dc10101/services/trackbacks/1232082.html</trackback:ping><description><![CDATA[摘要: 什么样的问题可以用递归？其实很多问题都可以用递归解决，例如数列的求和：#include&nbsp;&lt;iostream&gt;using&nbsp;namespace&nbsp;s...&nbsp;&nbsp;<a href='http://www.cnblogs.com/dc10101/archive/2008/06/29/1232082.html'>阅读全文</a><img src ="http://www.cnblogs.com/dc10101/aggbug/1232082.html?type=1" width = "1" height = "1" />]]></description></item><item><title>Eye Free</title><link>http://www.cnblogs.com/dc10101/archive/2007/08/22/865424.html</link><dc:creator>董超</dc:creator><author>董超</author><pubDate>Wed, 22 Aug 2007 06:59:00 GMT</pubDate><guid>http://www.cnblogs.com/dc10101/archive/2007/08/22/865424.html</guid><wfw:comment>http://www.cnblogs.com/dc10101/comments/865424.html</wfw:comment><comments>http://www.cnblogs.com/dc10101/archive/2007/08/22/865424.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/dc10101/comments/commentRss/865424.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/dc10101/services/trackbacks/865424.html</trackback:ping><description><![CDATA[摘要: EyeFree的诞生是为了解决一个实际问题。在TMM英语培训中有这样一种题型：给出一个由英文字母组成的12*12的矩阵，听录音，然后把听到的单词从这个矩阵中找出来，本来是要练习听力，却本末倒置，听懂...&nbsp;&nbsp;<a href='http://www.cnblogs.com/dc10101/archive/2007/08/22/865424.html'>阅读全文</a><img src ="http://www.cnblogs.com/dc10101/aggbug/865424.html?type=1" width = "1" height = "1" />]]></description></item><item><title>BinaryTree with C#</title><link>http://www.cnblogs.com/dc10101/archive/2007/01/01/609635.html</link><dc:creator>董超</dc:creator><author>董超</author><pubDate>Mon, 01 Jan 2007 10:29:00 GMT</pubDate><guid>http://www.cnblogs.com/dc10101/archive/2007/01/01/609635.html</guid><wfw:comment>http://www.cnblogs.com/dc10101/comments/609635.html</wfw:comment><comments>http://www.cnblogs.com/dc10101/archive/2007/01/01/609635.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/dc10101/comments/commentRss/609635.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/dc10101/services/trackbacks/609635.html</trackback:ping><description><![CDATA[摘要: 上了三年半的大学，学的计算机，我却一直不知道二叉树是干什么使的。最近在看《VisualC#2005从入门到精通》，书中说.NET类库里缺少二叉树这个类，于是就想自己写一个，没想到一边写着一边思考...&nbsp;&nbsp;<a href='http://www.cnblogs.com/dc10101/archive/2007/01/01/609635.html'>阅读全文</a><img src ="http://www.cnblogs.com/dc10101/aggbug/609635.html?type=1" width = "1" height = "1" />]]></description></item><item><title>ACM 题型算法分类</title><link>http://www.cnblogs.com/dc10101/archive/2006/10/25/540022.html</link><dc:creator>董超</dc:creator><author>董超</author><pubDate>Wed, 25 Oct 2006 15:14:00 GMT</pubDate><guid>http://www.cnblogs.com/dc10101/archive/2006/10/25/540022.html</guid><wfw:comment>http://www.cnblogs.com/dc10101/comments/540022.html</wfw:comment><comments>http://www.cnblogs.com/dc10101/archive/2006/10/25/540022.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/dc10101/comments/commentRss/540022.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/dc10101/services/trackbacks/540022.html</trackback:ping><description><![CDATA[摘要: 题目均来自：http://acm.pku.edu.cn/JudgeOnline/主流算法：1.搜索　//回溯2.DP（动态规划）　3.贪心　...&nbsp;&nbsp;<a href='http://www.cnblogs.com/dc10101/archive/2006/10/25/540022.html'>阅读全文</a><img src ="http://www.cnblogs.com/dc10101/aggbug/540022.html?type=1" width = "1" height = "1" />]]></description></item></channel></rss>