﻿<?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>C++博客-pengkuny-随笔分类-算法与数据结构</title><link>http://www.cppblog.com/pengkuny/category/2925.html</link><description>&lt;P&gt;&lt;FONT style="FONT-SIZE: 10pt; FILTER: glow(color=black); WIDTH: 100%; COLOR: #e4dc9b; LINE-HEIGHT: 150%; FONT-FAMILY: 楷体_GB2312"&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;我爱常安!我喜欢梦之旅. 常安,拥有傲人的嗓音,声线成熟动人,她的声音高入云端而又翩跹再三,可以穿透您的心灵而回味无穷,让您的耳畔回旋着那种高亢空灵的感觉,她的音质干静、技巧纯熟,擅长诠释抒情歌曲,亦能将怀旧民歌表现的淋漓尽致.&lt;/FONT&gt;&lt;/P&gt;
</description><language>zh-cn</language><lastBuildDate>Mon, 19 May 2008 14:23:53 GMT</lastBuildDate><pubDate>Mon, 19 May 2008 14:23:53 GMT</pubDate><ttl>60</ttl><item><title>弦截法求方程的一个实根</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22429.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 14:51:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22429.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22429.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22429.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22429.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22429.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算    源代码    VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22429.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22429.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 22:51 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22429.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>牛顿迭代法求非线性方程的一个实根</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22427.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 13:49:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22427.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22427.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22427.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22427.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22427.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算   源代码   VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22427.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22427.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 21:49 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22427.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>对分法求非线性方程的根</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22406.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 11:35:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22406.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22406.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22406.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22406.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22406.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-   源代码  VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22406.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22406.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 19:35 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22406.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>龙贝格积分(Romberg)</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22373.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 07:33:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22373.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22373.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22373.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22373.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22373.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-Romberg方法也称为逐次分半加速法。它是在梯形公式、辛卜生公式和柯特斯公式之间的关系的基础上，构造出一种加速计算积分的方法。 <br>龙贝格积分对于编程实现来说,一开始不太好懂.<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22373.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22373.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 15:33 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22373.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>复化梯形积分</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22347.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:56:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22347.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22347.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22347.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22347.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22347.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-   源代码    VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22347.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22347.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:56 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22347.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>变步长梯形积分</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22350.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:56:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22350.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22350.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22350.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22350.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22350.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-  源代码    VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22350.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22350.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:56 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22350.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>变步长Simpson积分</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22353.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:55:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22353.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22353.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22353.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22353.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22353.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-   源代码    VS2005&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22353.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22353.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:55 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22353.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>复化Simpson积分</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22348.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:55:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22348.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22348.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22348.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22348.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22348.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-    源代码    VS2005&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22348.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22348.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:55 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22348.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>牛顿插值法</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22253.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:55:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22253.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22253.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22253.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22253.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22253.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-    源代码  VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22253.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22253.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:55 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22253.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>拉格朗日(Lagrange)插值</title><link>http://www.cppblog.com/pengkuny/archive/2007/04/20/22238.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Fri, 20 Apr 2007 02:54:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2007/04/20/22238.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/22238.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2007/04/20/22238.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/22238.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/22238.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 数值计算-   源代码   VS2005实现&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2007/04/20/22238.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/22238.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2007-04-20 10:54 <a href="http://www.cppblog.com/pengkuny/archive/2007/04/20/22238.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>进程调度:先来先服务算法、时间片轮转调度算法</title><link>http://www.cppblog.com/pengkuny/archive/2006/12/04/15967.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Mon, 04 Dec 2006 04:16:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/12/04/15967.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/15967.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/12/04/15967.html#Feedback</comments><slash:comments>31</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/15967.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/15967.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: /*********************************/程序名称:进程调度算法:先来先服务算法、时间片轮转调度算法的实现copyright@ pengkuny主页:http://www.cppblog.com/pengkuny完成日期:2006.12.01参考资料:汤子瀛&lt;&lt;计算机操作系统&gt;&gt;/********************************/...&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/12/04/15967.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/15967.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-12-04 12:16 <a href="http://www.cppblog.com/pengkuny/archive/2006/12/04/15967.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>DFS和Bellman_Ford算法的代码实现</title><link>http://www.cppblog.com/pengkuny/archive/2006/12/02/15879.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Sat, 02 Dec 2006 02:34:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/12/02/15879.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/15879.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/12/02/15879.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/15879.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/15879.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 不想麻烦声明函数,所以把实现写到头文件中了,只剩下一个cpp文件main.cpp.    本程序实现了深度优先搜索非递归算法和单源最短路径Bellman_Ford算法;    DFS用非递归效率高,因为输入规模太大,递归让我电脑吃不消,   Bellman_Ford算法可以处理负权值图,这点比Dijkstra算法好.1/**//***********************************...&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/12/02/15879.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/15879.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-12-02 10:34 <a href="http://www.cppblog.com/pengkuny/archive/2006/12/02/15879.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归与分治</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/19/15438.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Sun, 19 Nov 2006 15:10:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/19/15438.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/15438.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/19/15438.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/15438.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/15438.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 递归与分治的区别:<br>相似之处都在于将都要将大问题划分为子问题,<br>递归与分治实际上并不是完全等同或完全对立的,<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/19/15438.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/15438.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-19 23:10 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/19/15438.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>生成无重复的随机数</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/12/15057.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Sun, 12 Nov 2006 04:05:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/12/15057.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/15057.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/12/15057.html#Feedback</comments><slash:comments>11</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/15057.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/15057.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 生成无重复的随机数,注意,是不重复的序列.<br>   通常的生成随机数的做法是不考虑重复的,因为即使重复也属于概率意义上的正常情况.但某些情况下需要不重复的随机数据,怎么办呢?<br>   我想从大方向上来说,应该只有两个方法.要么牺牲时间要么牺牲空间.&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/12/15057.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/15057.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-12 12:05 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/12/15057.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>百度公司来科大的面试题</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/09/14927.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Thu, 09 Nov 2006 15:05:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/09/14927.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14927.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/09/14927.html#Feedback</comments><slash:comments>17</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14927.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14927.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 编写程序，求所有蚂蚁都离<br>开木杆的最小时间和最大时间。<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/09/14927.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14927.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-09 23:05 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/09/14927.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>圆周率计算的数学依据--非常漂亮</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/09/14904.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Thu, 09 Nov 2006 07:43:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/09/14904.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14904.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/09/14904.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14904.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14904.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: “十位小数就足以使地球周界准确到一英寸以内，三十位小数便能使整个可见宇宙的四周准确到连最强大的显微镜都不能分辨的一个量。”&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/09/14904.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14904.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-09 15:43 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/09/14904.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>初探圆周率算法</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/09/14903.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Thu, 09 Nov 2006 07:18:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/09/14903.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14903.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/09/14903.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14903.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14903.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近两天在看圆周率的算法,网上流传这么一个经典的算法,														 1												#include						&lt;						stdio.h						&gt;																												 2																										long				...&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/09/14903.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14903.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-09 15:18 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/09/14903.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[转载]刻苦学习各种随机数的产生</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/08/14862.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Wed, 08 Nov 2006 10:52:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/08/14862.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14862.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/08/14862.html#Feedback</comments><slash:comments>15</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14862.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14862.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文简述了随机数的产生原理，并用 C 语言实现了迭代取中法，乘同余法等随机数产生方法，同时，还给出了在符合某种概率分布的随机变量的产生方法。&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/08/14862.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14862.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-08 18:52 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/08/14862.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>读者写者问题-读者优先</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/07/14817.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Tue, 07 Nov 2006 14:15:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/07/14817.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14817.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/07/14817.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14817.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14817.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  mutex和w只有两种状态:信号态和非信号态,不要用自减自加去理解(虽然ReleaseSemaphore(g_hReadSemaphore,1,NULL)的确就是自加实现V原语操作的,但WaitForSingleObject并不能够一直自减下去),处于非信号态,一直等待,一直检测,直到恢复信号态方可退出原语操作.<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/07/14817.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14817.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-07 22:15 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/07/14817.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>catalan数在数据结构中的应用</title><link>http://www.cppblog.com/pengkuny/archive/2006/11/06/14734.html</link><dc:creator>pengkuny</dc:creator><author>pengkuny</author><pubDate>Mon, 06 Nov 2006 08:39:00 GMT</pubDate><guid>http://www.cppblog.com/pengkuny/archive/2006/11/06/14734.html</guid><wfw:comment>http://www.cppblog.com/pengkuny/comments/14734.html</wfw:comment><comments>http://www.cppblog.com/pengkuny/archive/2006/11/06/14734.html#Feedback</comments><slash:comments>15</slash:comments><wfw:commentRss>http://www.cppblog.com/pengkuny/comments/commentRss/14734.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/pengkuny/services/trackbacks/14734.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 原理：<br>令h(1)＝1，catalan数满足递归式：<br>h(n)= h(1)*h(n-1) + h(2)*h(n-2) + ... + h(n-1)h(1) (其中n>=2)<br>该递推关系的解为：h(n)=c(2n-2,n-1)/n (n=1,2,3,...) <br>&nbsp;&nbsp;<a href='http://www.cppblog.com/pengkuny/archive/2006/11/06/14734.html'>阅读全文</a><img src ="http://www.cppblog.com/pengkuny/aggbug/14734.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/pengkuny/" target="_blank">pengkuny</a> 2006-11-06 16:39 <a href="http://www.cppblog.com/pengkuny/archive/2006/11/06/14734.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>