﻿<?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>BlogJava-SexTian-文章分类-算法</title><link>http://www.blogjava.net/chenkkkabc/category/39932.html</link><description>java学习</description><language>zh-cn</language><lastBuildDate>Wed, 24 Jun 2009 04:04:51 GMT</lastBuildDate><pubDate>Wed, 24 Jun 2009 04:04:51 GMT</pubDate><ttl>60</ttl><item><title>贪心算法</title><link>http://www.blogjava.net/chenkkkabc/articles/greedy.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 22 Jun 2009 10:12:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/greedy.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283560.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/greedy.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283560.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283560.html</trackback:ping><description><![CDATA[贪心算法
   <img src ="http://www.blogjava.net/chenkkkabc/aggbug/283560.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-22 18:12 <a href="http://www.blogjava.net/chenkkkabc/articles/greedy.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>回溯算法</title><link>http://www.blogjava.net/chenkkkabc/articles/backtracking.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 22 Jun 2009 05:49:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/backtracking.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283557.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/backtracking.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283557.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283557.html</trackback:ping><description><![CDATA[回溯法是一个既带有系统性又带有跳跃性的的搜索算法。它在包含问题的所有解的解空间树中，按照深度优先的策略，从根结点出发搜索解空间树。算法搜索至解空间树的任一结点时，总是先判断该结点是否肯定不包含问题的解。如果肯定不包含，则跳过对以该结点为根的子树的系统搜索，逐层向其祖先结点回溯。否则，进入该子树，继续按深度优先的策略进行搜索。回溯法在用来求问题的所有解时，要回溯到根，且根结点的所有子树都已被搜索遍才结束。而回溯法在用来求问题的任一解时，只要搜索到问题的一个解就可以结束。<br />
<br />
<img src ="http://www.blogjava.net/chenkkkabc/aggbug/283557.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-22 13:49 <a href="http://www.blogjava.net/chenkkkabc/articles/backtracking.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>动态规划</title><link>http://www.blogjava.net/chenkkkabc/articles/dynamic_programming.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 22 Jun 2009 05:48:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/dynamic_programming.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283555.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/dynamic_programming.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283555.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283555.html</trackback:ping><description><![CDATA[<p>动态规划</p>
<img src ="http://www.blogjava.net/chenkkkabc/aggbug/283555.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-22 13:48 <a href="http://www.blogjava.net/chenkkkabc/articles/dynamic_programming.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>分治算法</title><link>http://www.blogjava.net/chenkkkabc/articles/divide_and_conquer.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 22 Jun 2009 05:46:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/divide_and_conquer.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283554.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/divide_and_conquer.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283554.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283554.html</trackback:ping><description><![CDATA[1.定义<br />
把一个复杂的问题分解成多个相同或相似的子问题，再把子问题分成更小的子问题&#8230;&#8230;直到最后子问题可以简单的直接求解，再将子问题的解的合并即得到原问题的解。分治法产生子问题必然导致递归过程出现，可以利用递归技术缩小子问题进行求解。<br />
<br />
2.
<img src ="http://www.blogjava.net/chenkkkabc/aggbug/283554.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-22 13:46 <a href="http://www.blogjava.net/chenkkkabc/articles/divide_and_conquer.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>递归算法</title><link>http://www.blogjava.net/chenkkkabc/articles/recursion.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 22 Jun 2009 05:40:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/recursion.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283552.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/recursion.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283552.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283552.html</trackback:ping><description><![CDATA[1.定义<br />
把自己作为自身定义的一部分的方法叫做递归。通常把一个大型复杂的问题给分解成与原问题类似的规模较小的问题来求解。递归需要有边界条件、递归前进段和递归返回段。当边界条件不满足时，递归前进；当边界条件满足时，递归返回。<br />
<br />
2.数学基础<br />
数学归纳法<br />
递推公式&lt;=&gt;通项<br />
<br />
3.基本规则<br />
a.基本情况：至少有一种情况可以不用递归解决<br />
b.前进：任何递归调用必须朝着基本情况前进<br />
c.可行性：总是假设递归调用是可行的<br />
d.复利规则：永远不要在不同的递归调用中重复执行解决同一问题实例的工作<br />
<br />
4.优缺点<br />
结构简单、清晰，可读性好，易于验证正确性。<br />
浪费空间，执行效率低。<br />
<br />
5.实例<br />
阶乘<br />
二分搜索<br />
画尺子<br />
分形<br />
汉诺塔<br />
<img src ="http://www.blogjava.net/chenkkkabc/aggbug/283552.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-22 13:40 <a href="http://www.blogjava.net/chenkkkabc/articles/recursion.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二分搜索算法</title><link>http://www.blogjava.net/chenkkkabc/articles/binary_search.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Sun, 21 Jun 2009 08:26:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/binary_search.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283466.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/binary_search.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283466.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283466.html</trackback:ping><description><![CDATA[ <img src ="http://www.blogjava.net/chenkkkabc/aggbug/283466.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-21 16:26 <a href="http://www.blogjava.net/chenkkkabc/articles/binary_search.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>连续子序列最大和问题</title><link>http://www.blogjava.net/chenkkkabc/articles/maxmum_contiguous_subsequence_sum_problem.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Sat, 20 Jun 2009 15:48:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/maxmum_contiguous_subsequence_sum_problem.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/283416.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/maxmum_contiguous_subsequence_sum_problem.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/283416.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/283416.html</trackback:ping><description><![CDATA[ <img src ="http://www.blogjava.net/chenkkkabc/aggbug/283416.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-20 23:48 <a href="http://www.blogjava.net/chenkkkabc/articles/maxmum_contiguous_subsequence_sum_problem.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>排序算法</title><link>http://www.blogjava.net/chenkkkabc/articles/sort.html</link><dc:creator>chenkkkabc</dc:creator><author>chenkkkabc</author><pubDate>Mon, 01 Jun 2009 06:24:00 GMT</pubDate><guid>http://www.blogjava.net/chenkkkabc/articles/sort.html</guid><wfw:comment>http://www.blogjava.net/chenkkkabc/comments/279386.html</wfw:comment><comments>http://www.blogjava.net/chenkkkabc/articles/sort.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/chenkkkabc/comments/commentRss/279386.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/chenkkkabc/services/trackbacks/279386.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 排序是计算机数据处理中的一项最基本的操作。研究高效率的排序方法是数据结构的一个重要内容。假设n个记录的序列为{R1,R2,&#8230;Rn}，其相应的排序码为{K1，K2，&#8230;，Kn}。所谓排序就是将记录按排序码非递减（或非递增）的次序排列起来，形成新的有序序列。本文用java语言实现了8种最基本的排序算法，并对相关算法的实现和复杂度进行了分析。排序类publi...&nbsp;&nbsp;<a href='http://www.blogjava.net/chenkkkabc/articles/sort.html'>阅读全文</a><img src ="http://www.blogjava.net/chenkkkabc/aggbug/279386.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/chenkkkabc/" target="_blank">chenkkkabc</a> 2009-06-01 14:24 <a href="http://www.blogjava.net/chenkkkabc/articles/sort.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>