﻿<?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++博客-yuyang7的部落格-随笔分类-算法</title><link>http://www.cppblog.com/yuyang7/category/9984.html</link><description /><language>zh-cn</language><lastBuildDate>Mon, 30 Mar 2009 15:21:29 GMT</lastBuildDate><pubDate>Mon, 30 Mar 2009 15:21:29 GMT</pubDate><ttl>60</ttl><item><title>Permutation—全排列</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Mon, 30 Mar 2009 12:56:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78403.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78403.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78403.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个全排列是从一个有限集中选取元素，组成一个有序的序列，并且所有的元素出现且仅出现一次。&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78403.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-30 20:56 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>