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.
尾声
：
算法原理
｜
327
尾声：算法
原理
的代码来完成任务，其实只需要用任何一种排序算法对列表排序，然后从排好序的列表
中获取第四大元素即可。使用这个方法可以获得
O
(
n
log
n
)
的性能
，当然这并不是最高
效的解决方法。
在使用
Fortune
扫描算法
计算
Voronoi
图时，可以很容易地通过寻找多边形内共享无限
Voronoi
边的那些点来进行构建凸包。虽然使用该算法计算出的信息比需要的多，但是
这些输出结果可以用于许多有趣的问题，例如计算点集的的平面三角。
第
8
章描述的一系列问题看似关联，却不太容易将它们联系在一起。其实，所有这些问
题都可以归约为线性规划（
linear programming
），它们都可以使用现有的商用软件包（比
如
Maple
）来计算结果。然而，这个归约过程不但太过复杂，而且
Ford-Fulkerson
一族
的算法性能要远胜于那些用于解决线性规划的通用算法。第
8
章展示了如何解决流网络
中的最大流最小割问题，一旦掌握了这个算法，其他五个问题也就迎刃而解了。表
12-6
展示了第
8
章描述过的网络流算法。
表
12
-
6
：网络流算法
算法 最好 平均 最差 涉及概念
Ford-Fulkerson
E*mf E*mf E*mf
有向带权图和贪心
Edmonds-Karp
V*E
2
V*E
2
V*E
2
有向带权图和贪心
12.7 编写算法难，测试算法更难
本书谈到的算法大部分都是确定的（第
11
章除外），因此可以直接用它们开发测试用
例以确保行为正确。但是在第
7
章中，我们遇到了麻烦——寻路算法用于查找可能存 ...
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.