August 2017
Intermediate to advanced
360 pages
8h 35m
Chinese
Content preview from 算法技术手册（原书第2 版）
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
88
｜
第
4
章
因此
h
> (
n/
2
)
*
(
log
(
n
)
－
1)
。这个公式有什么含义呢？它的意思就是说，对给定的
n
个
元素进行排序，必定至少存在一条从根到叶子且路径长度为
h
的路径，也就是说，这个
算法在排序的过程中进行至少需要
h
次比较。注意，
h
是由一个函数
f
(
n
)
计算出来的，
在上述情况下
f
(
n
) = (1/2)
*
n
*
log(
n
)
－
n/
2
，表示任何基于比较的排序算法都至少需要
O(
n
log
n
)
次的比较才能完成排序。
4.11 参考文献
Bentley, J. and M. McIlroy,
“
Engineering a sort function,
”
Software
—
Practice
and
Experience
, 23(11): 1249-1265, 1993,
http://dx.doi.org/10.1002/spe.4380231105
.
Blum, M., R. Floyd, V. Pratt, R. Rivest, and R. Tarjan,
“
Time bounds for selection,
”
Journal
of Computer and System Sciences
, 7(4): 448-461, 1973,
http://dx.doi.org/ 10.1016/S0022-
0000(73)80033-9
.
Cormen, T. H., C. Leiserson, R. Rivest, and C. Stein,
Introduction to Algorithms ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.