<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 Log - Code Set</title><link>http://blog.csdn.net/hongweijin/category/50687.aspx</link><description>这里存储的是我平时写的小型代码，对本人我价值，可能对大家的价值不大，不过我以后会整理的。希望管理员不会认为我的这种存储是多余的^_^</description><dc:language>zh-CN</dc:language><lastUpdateTime>Sat, 01 Sep 2007 13:28:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>hongweijin</dc:creator><title>Prim 算法代码例子</title><link>http://blog.csdn.net/hongweijin/archive/2004/12/10/211570.aspx</link><pubDate>Fri, 10 Dec 2004 11:54:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/12/10/211570.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/211570.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/12/10/211570.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/211570.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=211570</trackback:ping><description>Prim 算法代码例子&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/211570.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>huffman树和huffman编码</title><link>http://blog.csdn.net/hongweijin/archive/2004/11/18/186347.aspx</link><pubDate>Thu, 18 Nov 2004 19:15:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/11/18/186347.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/186347.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/11/18/186347.aspx#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/186347.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=186347</trackback:ping><description>huffman树和huffman编码&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/186347.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>汇编中的不同进制的输入与输出操作</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/27/155612.aspx</link><pubDate>Wed, 27 Oct 2004 23:59:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/27/155612.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/155612.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/27/155612.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/155612.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=155612</trackback:ping><description>从键盘上接受两个4位十六进制数，在下一行以二进制形式输出两数的异或的结果。并将此二进制数的结果中的第3到第0与第15位到第12位对调，再以十六进制输出！&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/155612.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title> bezier曲线的插值模拟算法</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/23/148071.aspx</link><pubDate>Sat, 23 Oct 2004 09:49:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/23/148071.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/148071.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/23/148071.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/148071.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=148071</trackback:ping><description> bezier曲线的插值模拟算法(TC环境下的曲线实例)
&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/148071.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>字符串编程，将字符串S中出现的子串T1用字符串T2替代。</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/21/146141.aspx</link><pubDate>Thu, 21 Oct 2004 19:19:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/21/146141.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/146141.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/21/146141.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/146141.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=146141</trackback:ping><description>字符串编程，将字符串S中出现的子串T1用字符串T2替代。&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/146141.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>非压缩的bcd码表示的两位十进制运算</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/20/143594.aspx</link><pubDate>Wed, 20 Oct 2004 07:02:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/20/143594.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/143594.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/20/143594.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/143594.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=143594</trackback:ping><description>非压缩的bcd码表示的两位十进制运算,实现x*y/t并把结果存入u , u+1, u+2, u+3&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/143594.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>线性排序</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/13/134816.aspx</link><pubDate>Wed, 13 Oct 2004 13:36:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/13/134816.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/134816.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/13/134816.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/134816.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=134816</trackback:ping><description>线性排序&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/134816.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>堆栈</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/08/127818.aspx</link><pubDate>Fri, 08 Oct 2004 11:33:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/08/127818.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/127818.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/08/127818.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/127818.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=127818</trackback:ping><description>//////////////////////////////////////////////////////////////////////////
// 设置一个顺序栈SS和一个链栈LS，实现以下操作：
// 从键盘输入若干个正整数（以输入负数为结束标志），依次压入SS中。
// 然后分别显示输入数据的逆序和正序的值（可以用LS辅助实现显示正序的值）
// **屏幕显示如下例所示：
// 3  4  6  8  9  2  －1
// 2  9  8  6  4  3
// 3  4  6  8  9  2
// 其中栈的算法实现可以参考第三章教案后面部分，
// 对顺序栈和链栈的PUSH操作要求用同样的函数名，
// （POP操作也一样）注意：C＋＋中有函数重载的特性。
//
//////////////////////////////////////////////////////////////////////////

&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/127818.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>链表</title><link>http://blog.csdn.net/hongweijin/archive/2004/10/08/127613.aspx</link><pubDate>Fri, 08 Oct 2004 09:53:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/10/08/127613.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/127613.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/10/08/127613.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/127613.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=127613</trackback:ping><description>链表&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/127613.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>利用lagrange插值法计算函数值</title><link>http://blog.csdn.net/hongweijin/archive/2004/09/30/121903.aspx</link><pubDate>Thu, 30 Sep 2004 15:45:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/09/30/121903.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/121903.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/09/30/121903.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/121903.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=121903</trackback:ping><description>利用lagrange插值法计算函数值&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/121903.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>hongweijin</dc:creator><title>约瑟夫环的循环链表实现</title><link>http://blog.csdn.net/hongweijin/archive/2004/08/06/67571.aspx</link><pubDate>Fri, 06 Aug 2004 23:33:00 GMT</pubDate><guid>http://blog.csdn.net/hongweijin/archive/2004/08/06/67571.aspx</guid><wfw:comment>http://blog.csdn.net/hongweijin/comments/67571.aspx</wfw:comment><comments>http://blog.csdn.net/hongweijin/archive/2004/08/06/67571.aspx#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://blog.csdn.net/hongweijin/comments/commentRss/67571.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=67571</trackback:ping><description>约瑟夫环的循环链表实现&lt;img src ="http://blog.csdn.net/hongweijin/aggbug/67571.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>