<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom"><title type="text">博客园_鸟窝</title><subtitle type="text"/><id>http://feed.cnblogs.com/blog/u/14981/rss</id><updated>2009-12-19T09:40:51Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><generator>CNBlogs BlogServer</generator><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/"/><link rel="self" type="application/atom+xml" href="http://feed.cnblogs.com/blog/u/14981/rss"/><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627806.html</id><title type="text">希尔排序</title><summary type="text">希尔排序是一种插入排序法，它出自D.L.Shell，因此而得名。Shell排序又称作缩小增量排序。　　基本思想：　　不断把待排序的对象分成若干个小组，对同一小组内的对象采用直接插入法排序，当完成了所有对象都分在一个组内的排序后，排序过程结束。每次比较指定间距的两个数据项，若左边的值小于右边的值，则交换它们的位置。间距d按给定公式减少： di+1=（di +1）/2 ，直到d等于1为止。D可以选取{...</summary><published>2009-12-19T09:41:00Z</published><updated>2009-12-19T09:41:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627806.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627806.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627805.html</id><title type="text">插入排序</title><summary type="text">插入排序（Insertion Sort）的算法描述是一种简单直观的排序算法。它的工作原理是通过构建有序序列，对于未排序数据，在已排序序列中从后向前扫描，找到相应位置并插入。插入排序在实现上，通常采用in-place排序（即只需用到O(1)的额外空间的排序），因而在从后向前扫描过程中，需要反复把已排序元素逐步向后挪位，为最新元素提供插入空间。代码Code highlighting produced ...</summary><published>2009-12-19T09:39:00Z</published><updated>2009-12-19T09:39:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627805.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627805.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627803.html</id><title type="text">Comb排序</title><summary type="text">类别：排序-交换排序参看 维基百科的定义[代码]</summary><published>2009-12-19T09:33:00Z</published><updated>2009-12-19T09:33:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627803.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627803.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627802.html</id><title type="text">Gnome sort</title><summary type="text">类别：排序-交换排序参看 维基百科的定义Gnome sort is a sorting algorithm which is similarto insertion sort, except that moving an element to its proper place isaccomplished by a series of swaps, as in bubble sort. The n...</summary><published>2009-12-19T09:32:00Z</published><updated>2009-12-19T09:32:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627802.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627802.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627801.html</id><title type="text">鸡尾酒排序</title><summary type="text">类别：排序-交换排序参看 维基百科的定义鸡尾酒排序，也就是定向冒泡排序, 鸡尾酒搅拌排序, 搅拌排序 (也可以视作选择排序的一种变形), 涟漪排序, 来回排序 or 快乐小时排序, 是冒泡排序的一种变形。此算法与冒泡排序的不同处在于排序时是以双向在序列中进行排序。[代码]</summary><published>2009-12-19T09:31:00Z</published><updated>2009-12-19T09:31:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627801.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627801.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627798.html</id><title type="text">奇偶排序</title><summary type="text">[代码]类别：排序-交换排序参看 维基百科的定义</summary><published>2009-12-19T09:29:00Z</published><updated>2009-12-19T09:29:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627798.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627798.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627796.html</id><title type="text">快速排序</title><summary type="text">类别：排序-交换排序参看 维基百科的定义[代码]</summary><published>2009-12-19T09:27:00Z</published><updated>2009-12-19T09:27:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627796.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627796.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627794.html</id><title type="text">冒泡排序</title><summary type="text">冒泡排序（Bubble Sort）是一种简单的排序算法。它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。这个算法的名字由来是因为越小的元素会经由交换慢慢&amp;ldquo;浮&amp;rdquo;到数列的顶端。代码Code highlighting produced by Actipro CodeHigh...</summary><published>2009-12-19T09:26:00Z</published><updated>2009-12-19T09:26:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627794.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627794.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/19/1627792.html</id><title type="text">algorithm in c#</title><summary type="text">最近研究算法，把常用的算法用C#实现了。整理了一下列在这里，以备查找。排序算法交换排序冒泡排序快速排序奇偶排序鸡尾酒排序Gnome SortComb Sort插入排序插入排序 希尔排序选择排序选择排序 堆排序合并排序合并排序 Strand排序搜索算法二分搜索Interpolation搜索jump搜索非线性搜索快速选择算法ternary选择算法Uniform二分搜索混淆（洗牌算法）KnuthShuf...</summary><published>2009-12-19T09:24:00Z</published><updated>2009-12-19T09:24:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627792.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/19/1627792.html"/></entry><entry><id>http://www.cnblogs.com/smallnest/archive/2009/12/15/1625006.html</id><title type="text">开发人员最喜爱的十大免费的Visual Studio插件(下)</title><summary type="text">开发人员最喜爱的十大免费的Visual Studio插件(下)6.	VsVim7.	VS 2008 File Finder8.	PowerCommands for Visual Studio 20089.	TracExplorer10.	Clone Detective for Visual Studio</summary><published>2009-12-15T11:16:00Z</published><updated>2009-12-15T11:16:00Z</updated><author><name>smallnest</name><uri>http://www.cnblogs.com/smallnest/</uri></author><link rel="alternate" href="http://www.cnblogs.com/smallnest/archive/2009/12/15/1625006.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/smallnest/archive/2009/12/15/1625006.html"/></entry></feed>
