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 版)
排序算法
63
排序算法
堆排序算法小结
最好情况、最坏情况和平均情况:
O
(
n
log
n
)
sort (A)
buildHeap (A)
for i = n-1 downto 1 do
swap A[0] with A[i]
heapify (A, 0, i)
end
buildHeap (A)
for i = n/2-1 downto 0 do
heapify (A, i, n)
end
#
递归执行以确保
A[idx, max)
是合法堆
heapify (A, idx, max)
largest = idx
left=2*idx+1
right = 2*idx + 2
if left < max and A[left] > A[idx] then
largest = left
if right < max and A[right] > A[largest] then
largest = right
if largest =? idx then
swap A[idx] and A[largest]
heapify (A, largest, max)
end
假设
A[idx]
的父点要大于等于其子结点中的任意一个。
左子点大于父点。
右子点大于父点或者左兄弟点。
4-4
展示了在具有
6
个元素的数组上执行
buildHeap
的过程。
堆就是一棵二叉树,它的结构具备以下两个性质:
外形性质
当且仅当深度
k
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