Skip to Content
算法技术手册(原书第2 版)
book

算法技术手册(原书第2 版)

by George T.Heineman, Gary Pollice, Stanley Selkow
August 2017
Intermediate to advanced
360 pages
8h 35m
Chinese
China Machine Press
Content preview from 算法技术手册(原书第2 版)
68
4
可以看到最开始的时候,非递归实现消除了堆排序中的递归而使性能得到显著提升,
但是这种性能差别随着
n
的不断增加有所减少。
4.5 基于分区的排序算法
分治策略解决问题的方法是将问题分解成两个大小约为原问题一半的独立子问题。将这
种策略应用到排序算法中的过程如下:找出集合
A
中的
中位数
,将其与数组
A
中间位置
的数交换。接着,将左半部分比
A
[
mid
]
大的元素与右半部分小于等于
A
[
mid
]
的元素进
行交换。这样,原数组就被切分成两个完全分开的子数组,这样就可以通过递归地对它
们进行排序来完成对原始集合
A
的排序。
这种方法的实现极具挑战性,因为要在不排序的前提下找出集合的中位数并不那么显而
易见。事实表明,可以使用
A
中的任意元素将
A
切分成两个子数组,如果每次都能“聪明地”
挑选元素,就能使得子数组或多或少地具有相同的大小,从而获得更高效算法实现。
假定存在函数
p
=
partition
(
A
,
left
,
right
,
pivotIndex
) ,
它使用集合
A
中的一个特殊中枢值
pivot
来对
A
进行修改,并返回
A
中的位置
p
,满足:
A
[
p
] =
pivot
A
[
left
,
p
)
范围内的所有元素都小于等于中枢值
pivot
A
[
p
+ 1,
right
]
范围内的所有元素都大于中枢值
pivot
如果足够幸运,当
分区
完成后,两个子数组的大小会等于原始集合的一半。例
4-5
出了分区的
C
语言实现。
4-5
:将
ar[left,right]
针对给定中枢值元素进行分区的
C
语言实现
/**
*
在线性时间内,将数组 ...
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

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’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.
Head of Cybersecurity
QuotationMarkI 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.
Field Engineer
QuotationMarkI’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.
Data Platform Tech Lead
QuotationMarkI'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.
Mark W.
Embedded Software Engineer

You might also like

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

Aurélien Géron
Go语言编程

Go语言编程

威廉·肯尼迪

Publisher Resources

ISBN: 9787111562221