﻿<?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>博客园-Robin's Space-随笔分类-算法</title><link>http://www.cnblogs.com/jillzhang/category/73522.html</link><description>高山安可仰,徒此挹清芬</description><language>zh-cn</language><lastBuildDate>Thu, 09 Apr 2009 05:02:31 GMT</lastBuildDate><pubDate>Thu, 09 Apr 2009 05:02:31 GMT</pubDate><ttl>60</ttl><item><title>Gif图像解码器</title><link>http://www.cnblogs.com/jillzhang/archive/2008/02/27/1084196.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Wed, 27 Feb 2008 14:17:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2008/02/27/1084196.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/1084196.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2008/02/27/1084196.html#Feedback</comments><slash:comments>24</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/1084196.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/1084196.html</trackback:ping><description><![CDATA[摘要: 上一篇LZW压缩算法解码器实现中，实现了lzw压缩算法的解码，如果完成那一步，其实gif的解码已经实现大一半了，可以说攻克了技术难点，本文给出gif图像文件的解码器实现，对算法和gif图像有兴趣的同学可以下载下去研究。注：算法需要静下来来慢慢研究，心急气躁，急功近利者就免了，以防走火入魔，：） &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2008/02/27/1084196.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/1084196.html?type=1" width = "1" height = "1" />]]></description></item><item><title>LZW压缩算法解码器实现</title><link>http://www.cnblogs.com/jillzhang/archive/2008/02/26/1082504.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Tue, 26 Feb 2008 08:58:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2008/02/26/1082504.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/1082504.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2008/02/26/1082504.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/1082504.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/1082504.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;本文先给出具体的代码实现，懂一些LZW算法理论，基本上如果静下心来，都能看明白解码器的实现。如果不太清楚LZW,可以查看下以前的一篇帖子：http://www.cnblogs...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2008/02/26/1082504.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/1082504.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列之八皇后问题</title><link>http://www.cnblogs.com/jillzhang/archive/2007/10/21/922830.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sun, 21 Oct 2007 07:19:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/10/21/922830.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/922830.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/10/21/922830.html#Feedback</comments><slash:comments>9</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/922830.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/922830.html</trackback:ping><description><![CDATA[摘要:  中国有一句古话，叫做“不撞南墙不回头"，生动的说明了一个人的固执，有点贬义，但是在软件编程中，这种思路确是一种解决问题最简单的算法，它通过一种类似于蛮干的思路，一步一步地往前走，每走一步都更靠近目标结果一些，直到遇到障碍物，我们才考虑往回走。然后再继续尝试向前。通过这样的波浪式前进方法，最终达到目的地。当然整个过程需要很多往返，这样的前进方式，效率比较低下。<br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/10/21/922830.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/922830.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列之经典背包问题</title><link>http://www.cnblogs.com/jillzhang/archive/2007/10/06/915035.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Fri, 05 Oct 2007 16:25:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/10/06/915035.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/915035.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/10/06/915035.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/915035.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/915035.html</trackback:ping><description><![CDATA[摘要: 我们人类是一种贪婪的动物，如果给您一个容量一定的背包和一些大小不一的物品，裝到背包里面的物品就归您，遇到这种好事大家一定不会错过，用力塞不一定是最好的办法，用脑子才行，下面就教您如何解决这样的问题，以获得更多的奖品。<br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/10/06/915035.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/915035.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列之寻找第K大</title><link>http://www.cnblogs.com/jillzhang/archive/2007/10/04/913478.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Wed, 03 Oct 2007 23:20:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/10/04/913478.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/913478.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/10/04/913478.html#Feedback</comments><slash:comments>18</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/913478.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/913478.html</trackback:ping><description><![CDATA[摘要: 国人向来喜欢论资排辈的,每个人都想当老大,实在当不成,当个老二,老三,老K也不错,您一定看过这样的争论: 两个人吵架,一个人非常强势,另外一个忍受不住了便说:"你算老几呀?",下面就通过这篇文章就是要解决找出老几的问题!&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/10/04/913478.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/913478.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列之三（快速排序）</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/23/902970.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sat, 22 Sep 2007 23:44:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/23/902970.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/902970.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/23/902970.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/902970.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/902970.html</trackback:ping><description><![CDATA[摘要: 介绍利用递归算法实现快速排序的过程&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/23/902970.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/902970.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列二（归并排序）</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894936.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sun, 16 Sep 2007 10:53:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894936.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/894936.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894936.html#Feedback</comments><slash:comments>9</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/894936.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/894936.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/16/894936.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/894936.html?type=1" width = "1" height = "1" />]]></description></item><item><title>递归算法学习系列一（分而治之策略）</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894586.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sun, 16 Sep 2007 03:02:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894586.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/894586.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/16/894586.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/894586.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/894586.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/16/894586.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/894586.html?type=1" width = "1" height = "1" />]]></description></item><item><title>大牛生小牛的问题</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/09/887286.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sun, 09 Sep 2007 03:00:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/09/887286.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/887286.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/09/887286.html#Feedback</comments><slash:comments>47</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/887286.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/887286.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/09/887286.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/887286.html?type=1" width = "1" height = "1" />]]></description></item><item><title>算法：【一列数的规则如下: 1、1、2、3、5、8、13、21、34 ，求第30位数是多少， 用递归算法实现。(C#语言)】</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/05/882342.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Wed, 05 Sep 2007 01:03:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/05/882342.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/882342.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/05/882342.html#Feedback</comments><slash:comments>25</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/882342.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/882342.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/05/882342.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/882342.html?type=1" width = "1" height = "1" />]]></description></item><item><title>算法函数：得到一个字符串中的最大长度的数字</title><link>http://www.cnblogs.com/jillzhang/archive/2007/09/04/881148.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Tue, 04 Sep 2007 02:25:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/09/04/881148.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/881148.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/09/04/881148.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/881148.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/881148.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/09/04/881148.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/881148.html?type=1" width = "1" height = "1" />]]></description></item><item><title>浮点数在计算机中存储方式</title><link>http://www.cnblogs.com/jillzhang/archive/2007/06/24/793901.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sun, 24 Jun 2007 12:18:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/06/24/793901.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/793901.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/06/24/793901.html#Feedback</comments><slash:comments>19</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/793901.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/793901.html</trackback:ping><description><![CDATA[摘要: 哈哈，等了一天了，终于可以发布了，嘿嘿嘿，新机房后第一个帖：）&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/06/24/793901.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/793901.html?type=1" width = "1" height = "1" />]]></description></item><item><title>打靶算法分析</title><link>http://www.cnblogs.com/jillzhang/archive/2007/02/01/636889.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Thu, 01 Feb 2007 06:37:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2007/02/01/636889.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/636889.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2007/02/01/636889.html#Feedback</comments><slash:comments>30</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/636889.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/636889.html</trackback:ping><description><![CDATA[摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2007/02/01/636889.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/636889.html?type=1" width = "1" height = "1" />]]></description></item><item><title>LZW数据压缩算法的原理分析</title><link>http://www.cnblogs.com/jillzhang/archive/2006/11/06/551298.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Mon, 06 Nov 2006 06:48:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2006/11/06/551298.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/551298.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2006/11/06/551298.html#Feedback</comments><slash:comments>32</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/551298.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/551298.html</trackback:ping><description><![CDATA[摘要: 人人都要大，而我偏爱小，大有大的妙，小有小的好&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2006/11/06/551298.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/551298.html?type=1" width = "1" height = "1" />]]></description></item><item><title>hash是如何处理冲突的?</title><link>http://www.cnblogs.com/jillzhang/archive/2006/11/03/548671.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Fri, 03 Nov 2006 03:09:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2006/11/03/548671.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/548671.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2006/11/03/548671.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/548671.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/548671.html</trackback:ping><description><![CDATA[摘要: 老师拿着座位表，找到张三的座位，"啊？为什么这个位置上有两人，你们谁是张三？"&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2006/11/03/548671.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/548671.html?type=1" width = "1" height = "1" />]]></description></item><item><title>哈希查找因何快？我们使用它需要付出什么代价</title><link>http://www.cnblogs.com/jillzhang/archive/2006/11/02/547679.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Thu, 02 Nov 2006 06:12:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2006/11/02/547679.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/547679.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2006/11/02/547679.html#Feedback</comments><slash:comments>16</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/547679.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/547679.html</trackback:ping><description><![CDATA[摘要: 在你享受这之前，必须受别人吃不了的苦，忍受别人受不了的屈辱&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2006/11/02/547679.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/547679.html?type=1" width = "1" height = "1" />]]></description></item><item><title>两个大数相加比较符合自然运算的算法</title><link>http://www.cnblogs.com/jillzhang/archive/2006/10/22/536198.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Sat, 21 Oct 2006 18:06:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2006/10/22/536198.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/536198.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2006/10/22/536198.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/536198.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/536198.html</trackback:ping><description><![CDATA[摘要: 两个大数相加比较符合自然运算的算法&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2006/10/22/536198.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/536198.html?type=1" width = "1" height = "1" />]]></description></item><item><title>lzw压缩算法</title><link>http://www.cnblogs.com/jillzhang/archive/2006/10/17/531631.html</link><dc:creator>Robin Zhang</dc:creator><author>Robin Zhang</author><pubDate>Tue, 17 Oct 2006 09:58:00 GMT</pubDate><guid>http://www.cnblogs.com/jillzhang/archive/2006/10/17/531631.html</guid><wfw:comment>http://www.cnblogs.com/jillzhang/comments/531631.html</wfw:comment><comments>http://www.cnblogs.com/jillzhang/archive/2006/10/17/531631.html#Feedback</comments><slash:comments>11</slash:comments><wfw:commentRss>http://www.cnblogs.com/jillzhang/comments/commentRss/531631.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jillzhang/services/trackbacks/531631.html</trackback:ping><description><![CDATA[摘要: usingSystem;usingSystem.IO;namespaceGif.Components{&nbsp;publicclassLZWEncoder&nbsp;{&nbsp...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jillzhang/archive/2006/10/17/531631.html'>阅读全文</a><img src ="http://www.cnblogs.com/jillzhang/aggbug/531631.html?type=1" width = "1" height = "1" />]]></description></item></channel></rss>