http://www.juliuschen.com Mon, 17 Oct 2011 10:30:11 +0000 en hourly 1 http://wordpress.org/?v=3.2.1 http://www.juliuschen.com/archives/15.html http://www.juliuschen.com/archives/15.html#comments Fri, 25 Dec 2009 09:54:43 +0000 Julius Chen http://www.juliuschen.com/archives/15 >4*i&0xf处）会稍显复杂，效率也稍低。 基数排序的时间复杂度如上面所说是线性的O(n)，由于是非比较排序，所以可以突破比较排序O(n㏒n)的时间复杂度下限。因此通常来说比所有的比较排序都快。但由于计数排序的内部循环中的操作数目比快速排序或归并排序内部循环要多的多，因此这里的线性运行时间可能并不比快速排序的运行时间少很多。 基数排序还有一个问题是它的应用范围并不如比较排序应用的广泛，这主要是因为基数排序基于的关键字抽取算法没有比较排序的比较操作那么普遍。 基数排序是稳定的排序方法。]]> http://www.juliuschen.com/archives/15.html/feed 0 http://www.juliuschen.com/archives/14.html http://www.juliuschen.com/archives/14.html#comments Thu, 24 Dec 2009 10:34:17 +0000 Julius Chen http://www.juliuschen.com/archives/14 http://www.juliuschen.com/archives/14.html/feed 0 http://www.juliuschen.com/archives/13.html http://www.juliuschen.com/archives/13.html#comments Tue, 22 Dec 2009 10:27:11 +0000 Julius Chen http://www.juliuschen.com/archives/13 http://www.juliuschen.com/archives/13.html/feed 0 http://www.juliuschen.com/archives/12.html http://www.juliuschen.com/archives/12.html#comments Mon, 21 Dec 2009 10:12:45 +0000 Julius Chen http://www.juliuschen.com/archives/12 http://www.juliuschen.com/archives/12.html/feed 0 http://www.juliuschen.com/archives/11.html http://www.juliuschen.com/archives/11.html#comments Sun, 20 Dec 2009 07:50:37 +0000 Julius Chen http://www.juliuschen.com/archives/11 http://www.juliuschen.com/archives/11.html/feed 0 http://www.juliuschen.com/archives/10.html http://www.juliuschen.com/archives/10.html#comments Tue, 15 Dec 2009 12:37:25 +0000 Julius Chen http://www.juliuschen.com/archives/10 继续阅读 →]]> http://www.juliuschen.com/archives/10.html/feed 0 http://www.juliuschen.com/archives/9.html http://www.juliuschen.com/archives/9.html#comments Mon, 14 Dec 2009 15:03:55 +0000 Julius Chen http://www.juliuschen.com/archives/9 http://www.juliuschen.com/archives/9.html/feed 0