﻿<?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++博客-Daly的游戏人生-随笔分类-数据结构与算法</title><link>http://www.cppblog.com/daly88/category/12302.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 18 Jun 2010 20:18:32 GMT</lastBuildDate><pubDate>Fri, 18 Jun 2010 20:18:32 GMT</pubDate><ttl>60</ttl><item><title>高效的Timer实现</title><link>http://www.cppblog.com/daly88/archive/2010/05/26/116414.html</link><dc:creator>Daly</dc:creator><author>Daly</author><pubDate>Wed, 26 May 2010 12:44:00 GMT</pubDate><guid>http://www.cppblog.com/daly88/archive/2010/05/26/116414.html</guid><wfw:comment>http://www.cppblog.com/daly88/comments/116414.html</wfw:comment><comments>http://www.cppblog.com/daly88/archive/2010/05/26/116414.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/daly88/comments/commentRss/116414.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/daly88/services/trackbacks/116414.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     很多程序都需要处理一系列定时事件, 本文就见过的程序中，几种实现Timer的方法。用到的数据结构一般有链表, 堆, RB树，hash table等，还有一些比较优化的方法。&nbsp;&nbsp;<a href='http://www.cppblog.com/daly88/archive/2010/05/26/116414.html'>阅读全文</a><img src ="http://www.cppblog.com/daly88/aggbug/116414.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/daly88/" target="_blank">Daly</a> 2010-05-26 20:44 <a href="http://www.cppblog.com/daly88/archive/2010/05/26/116414.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>红黑树的实现与讨论</title><link>http://www.cppblog.com/daly88/archive/2009/11/20/101519.html</link><dc:creator>Daly</dc:creator><author>Daly</author><pubDate>Fri, 20 Nov 2009 12:21:00 GMT</pubDate><guid>http://www.cppblog.com/daly88/archive/2009/11/20/101519.html</guid><wfw:comment>http://www.cppblog.com/daly88/comments/101519.html</wfw:comment><comments>http://www.cppblog.com/daly88/archive/2009/11/20/101519.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/daly88/comments/commentRss/101519.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/daly88/services/trackbacks/101519.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   本文讨论了红黑树的代码实现细节，并给出几种实现版本的测试结果。红黑树作者sedgewick在08年提出的左斜红黑树以及递归实现，大大简化了代码量，但是牺牲了一点性能，本文也给出参考地址。&nbsp;&nbsp;<a href='http://www.cppblog.com/daly88/archive/2009/11/20/101519.html'>阅读全文</a><img src ="http://www.cppblog.com/daly88/aggbug/101519.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/daly88/" target="_blank">Daly</a> 2009-11-20 20:21 <a href="http://www.cppblog.com/daly88/archive/2009/11/20/101519.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>动态优先队列</title><link>http://www.cppblog.com/daly88/archive/2009/11/17/101181.html</link><dc:creator>Daly</dc:creator><author>Daly</author><pubDate>Tue, 17 Nov 2009 03:38:00 GMT</pubDate><guid>http://www.cppblog.com/daly88/archive/2009/11/17/101181.html</guid><wfw:comment>http://www.cppblog.com/daly88/comments/101181.html</wfw:comment><comments>http://www.cppblog.com/daly88/archive/2009/11/17/101181.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/daly88/comments/commentRss/101181.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/daly88/services/trackbacks/101181.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     在很多图算法实现中都需要用到优先队列，这些优先队列需要能动态改变堆内对应元素的值，并更新堆。本文利用两个数组，保存了堆和原数组的相互映射。&nbsp;&nbsp;<a href='http://www.cppblog.com/daly88/archive/2009/11/17/101181.html'>阅读全文</a><img src ="http://www.cppblog.com/daly88/aggbug/101181.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/daly88/" target="_blank">Daly</a> 2009-11-17 11:38 <a href="http://www.cppblog.com/daly88/archive/2009/11/17/101181.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>闲话STL与数据结构实现</title><link>http://www.cppblog.com/daly88/archive/2009/11/15/100971.html</link><dc:creator>Daly</dc:creator><author>Daly</author><pubDate>Sun, 15 Nov 2009 05:40:00 GMT</pubDate><guid>http://www.cppblog.com/daly88/archive/2009/11/15/100971.html</guid><wfw:comment>http://www.cppblog.com/daly88/comments/100971.html</wfw:comment><comments>http://www.cppblog.com/daly88/archive/2009/11/15/100971.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/daly88/comments/commentRss/100971.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/daly88/services/trackbacks/100971.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     关于STL与自己实现数据结构的讨论，以及在C中实现类型无关数据结构的编程技巧。&nbsp;&nbsp;<a href='http://www.cppblog.com/daly88/archive/2009/11/15/100971.html'>阅读全文</a><img src ="http://www.cppblog.com/daly88/aggbug/100971.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/daly88/" target="_blank">Daly</a> 2009-11-15 13:40 <a href="http://www.cppblog.com/daly88/archive/2009/11/15/100971.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>