﻿<?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>博客园-cacard-随笔分类-算法</title><link>http://www2.cnblogs.com/caca/category/91835.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 10 Apr 2009 06:16:02 GMT</lastBuildDate><pubDate>Fri, 10 Apr 2009 06:16:02 GMT</pubDate><ttl>60</ttl><item><title>广度优先搜索解决九宫问题</title><link>http://www.cnblogs.com/caca/archive/2007/12/04/981759.html</link><dc:creator>cacard</dc:creator><author>cacard</author><pubDate>Mon, 03 Dec 2007 18:07:00 GMT</pubDate><guid>http://www.cnblogs.com/caca/archive/2007/12/04/981759.html</guid><wfw:comment>http://www.cnblogs.com/caca/comments/981759.html</wfw:comment><comments>http://www.cnblogs.com/caca/archive/2007/12/04/981759.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/caca/comments/commentRss/981759.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/caca/services/trackbacks/981759.html</trackback:ping><description><![CDATA[摘要: 这是布置的AI作业，今天有同学用奇怪的“旋转法”做了出来，虽然结果应该不是最优解，不过其思维方式还是很新颖的。课本上有广度优先的介绍，广先的好处是，如果有解，必定能够求出最优解！所以先尝试了一下广...&nbsp;&nbsp;<a href='http://www.cnblogs.com/caca/archive/2007/12/04/981759.html'>阅读全文</a><img src ="http://www.cnblogs.com/caca/aggbug/981759.html?type=1" width = "1" height = "1" />]]></description></item><item><title>Heapsort</title><link>http://www.cnblogs.com/caca/archive/2007/04/29/731668.html</link><dc:creator>cacard</dc:creator><author>cacard</author><pubDate>Sat, 28 Apr 2007 16:20:00 GMT</pubDate><guid>http://www.cnblogs.com/caca/archive/2007/04/29/731668.html</guid><wfw:comment>http://www.cnblogs.com/caca/comments/731668.html</wfw:comment><comments>http://www.cnblogs.com/caca/archive/2007/04/29/731668.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/caca/comments/commentRss/731668.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/caca/services/trackbacks/731668.html</trackback:ping><description><![CDATA[摘要: Heap是完全二叉树，所以可以用数组来隐式表示。对Heap的通常操作是删除和插入。删除就是去掉Heap的顶元素，然后重新建Heap.思想是，令Heap[1]=Heap[n]，然后调整这个Heap即可。...&nbsp;&nbsp;<a href='http://www.cnblogs.com/caca/archive/2007/04/29/731668.html'>阅读全文</a><img src ="http://www.cnblogs.com/caca/aggbug/731668.html?type=1" width = "1" height = "1" />]]></description></item><item><title>快速排序与挑白菜</title><link>http://www.cnblogs.com/caca/archive/2007/04/28/730908.html</link><dc:creator>cacard</dc:creator><author>cacard</author><pubDate>Sat, 28 Apr 2007 04:19:00 GMT</pubDate><guid>http://www.cnblogs.com/caca/archive/2007/04/28/730908.html</guid><wfw:comment>http://www.cnblogs.com/caca/comments/730908.html</wfw:comment><comments>http://www.cnblogs.com/caca/archive/2007/04/28/730908.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/caca/comments/commentRss/730908.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/caca/services/trackbacks/730908.html</trackback:ping><description><![CDATA[摘要: 快排的两个步骤：1，找基准点；2，递归1；挑白菜的方法来解释：先设定“分段点”为第一个白菜x[0]，称为“标准大小的白菜”;L站x[1]，向右挑；R站在x[n-1]，向左挑;循环（直到两人碰面之后停止...&nbsp;&nbsp;<a href='http://www.cnblogs.com/caca/archive/2007/04/28/730908.html'>阅读全文</a><img src ="http://www.cnblogs.com/caca/aggbug/730908.html?type=1" width = "1" height = "1" />]]></description></item><item><title>VIPS:基于视觉的Web页面切割算法</title><link>http://www.cnblogs.com/caca/archive/2007/04/26/728320.html</link><dc:creator>cacard</dc:creator><author>cacard</author><pubDate>Thu, 26 Apr 2007 14:24:00 GMT</pubDate><guid>http://www.cnblogs.com/caca/archive/2007/04/26/728320.html</guid><wfw:comment>http://www.cnblogs.com/caca/comments/728320.html</wfw:comment><comments>http://www.cnblogs.com/caca/archive/2007/04/26/728320.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/caca/comments/commentRss/728320.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/caca/services/trackbacks/728320.html</trackback:ping><description><![CDATA[摘要: VIPS是MicrosoftResearchAsia的几位实习学生提出的算法，可在MSR里面查看详细信息，另外还有中文简略介绍，还有一个C#写的简单实现。他们的思想是根据HTML源代...&nbsp;&nbsp;<a href='http://www.cnblogs.com/caca/archive/2007/04/26/728320.html'>阅读全文</a><img src ="http://www.cnblogs.com/caca/aggbug/728320.html?type=1" width = "1" height = "1" />]]></description></item></channel></rss>