Analysis of Heapsort

Analysis of Algorithms
CMSC 142
Analysis of Heapsort
INSERTION SORT
MERGE SORT
HEAP SORT
FEW UNIQUE
RANDOM
REVERSED
3
ALMOST SORTED
Heap Types
Max-heaps (largest element at root), have the
max-heap property:
for all nodes i, excluding the root:
A[PARENT(i)] A[i]
Min-heaps (smallest element at root), have the

min-heap property:
for all nodes i, excluding the root:
A[PARENT(i)] A[i]
4
Adding/Deleting Nodes
New nodes are always inserted at the bottom
level (left to right)
Nodes are removed from the bottom level (right
to left)
Operations on Heaps
Maintain/Restore the max-heap property
MAX-HEAPIFY
Create a max-heap from an unordered array

BUILD-MAX-HEAP
Sort an array in place

HEAPSORT
Priority queues
Maintaining the Heap Property
Suppose a node is smaller than a

child
Left and Right subtrees of i are max-heaps
To eliminate the violation:

Exchange with larger child
Move down the tree
Continue until node is not smaller than
children
Example
MAX-HEAPIFY(A, 2, 10)
A[2] A[4]
A[2] violates the heap property
A[4] violates the heap property
A[4] A[9]
Heap property restored

8
Maintaining the Heap Property

Assumptions:
Alg: MAX-HEAPIFY(A, i, n)
Left and Right
1. l LEFT(i)
subtrees of i are 2. r RIGHT(i)
max-heaps
3. if l n and A[l] > A[i]
A[i] may be
4.
then largest l
smaller than its
5.
else largest i
children
6. if r n and A[r] > A[largest]
7.
then largest r
8. if largest i
9.
then exchange A[i] A[largest]
10.
MAX-HEAPIFY(A, largest, n)
9
MAX-HEAPIFY Running Time

Intuitively:
-
h
O(h)
2h
Running time of MAX-HEAPIFY is O(lgn)

Can be written in terms of the height of the heap,
as being O(h)
Since the height of the heap is lgn
10
Building a Heap
Convert an array A[1 n] into a max-heap (n = length[A])
The elements in the subarray A[( n/2 +1) .. n] are leaves
Apply MAX-HEAPIFY on elements between 1 and n/2
Alg: BUILD-MAX-HEAP(A)
1.
2.
3.
n = length[A]
4
2
for i n/2 downto 1

8
14
A:
do MAX-HEAPIFY(A, i, n)
1
3
5
16 9
10
16
10 14
10
7
11
Example:
14
14
16 9
2
7
10 8
14
10
16 9
2
7
10 8
14
3
5
10
i=1
1
16
16 9
10
2
7
4
8
14
16
9
10
10
2
7
4
8
16 9
i=2
5
10
10 14
i=3
5
10
16
i=4
i=5
1
10
14
9
10
10
3
12
Running Time of BUILD MAX HEAP

1.
n = length[A]
2.
for i n/2 downto 1
3.
O(lgn)
O(n)
Running time: O(nlgn)

This is not an asymptotically tight upper bound
13

HEAPIFY takes O(h) the cost of HEAPIFY on a node i is
proportional to the height ofh the node i in the tree
h
Height
T (n) ni hi 2i h i O(n)
i 0
i 0
Level
No. of nodes
h0 = 3 ( lgn )
i=0
20
h1 = 2
i=1
21
h2 = 1
i=2
22
h3 = 0
i = 3 ( lgn )
23
hi = h i height of the heap rooted at level i

ni = 2i
number of nodes at level i
14

h
T (n) ni hi
Cost of HEAPIFY at level i number of nodes at that level
i 0
h
2i h i
Replace the values of ni and hi computed before
i 0
hi
h i 2 h
i 0 2
h
k
h
2 k
k 0 2
h
k
k
2
k 0
Multiply by 2h both at the nominator and denominator and

write 2i as 1
2 i
Change variables: k = h - i
The sum above is smaller than the sum of all elements to

and h = lgn
O(n)
The sum above is smaller than 2
Running time of BUILD-MAX-HEAP: T(n) = O(n)
15
Heapsort
Goal:
Sort an array using heap representations
Idea:
Build a max-heap from the array
Swap the root (the maximum element) with the last
element in the array
Discard this last node by decreasing the heap size
Call MAX-HEAPIFY on the new root
Repeat this process until only one node remains
16
Example:
A=[7, 4, 3, 1, 2]
17
Alg: HEAPSORT(A)
1. BUILD-MAX-HEAP(A)
O(n)
2. for i length[A] downto 2

3.
4.
n-1 times
do exchange A[1] A[i]

MAX-HEAPIFY(A, 1, i - 1)
O(lgn)
Running time: O(nlgn) --- Can be

shown to be (nlgn)
18
Operations
on Priority Queues
Max-priority queues support the following
operations:
INSERT(S, x): inserts element x into set S
EXTRACT-MAX(S): removes and returns element of
S with largest key
MAXIMUM(S): returns element of S with largest key
INCREASE-KEY(S, x, k): increases value of element
xs key to k (Assume k xs current key value)
19
HEAP-MAXIMUM
Goal:
Return the largest element of the heap
Alg: HEAP-MAXIMUM(A)
1.
Running time: O(1)
return A[1]
Heap A:
Heap-Maximum(A) returns 7
20
HEAP-EXTRACT-MAX
Goal:
Extract the largest element of the heap (i.e., return the max
value and also remove that element from the heap
Idea:
Exchange the root element with the last
Decrease the size of the heap by 1 element
Call MAX-HEAPIFY on the new root, on a heap of size n-1
Heap A:
Root is the largest element
21
Example: HEAP-EXTRACT-MAX
16
14
7
4
max = 16
10
8
2
14
10
Heap size decreased with 1
14
Call MAX-HEAPIFY(A, 1, n-1)
8
4
2
10
7
1
22
HEAP-EXTRACT-MAX
Alg: HEAP-EXTRACT-MAX(A, n)
1. if n < 1
2.
then error heap underflow
3.
max A[1]
4.
A[1] A[n]
5.
MAX-HEAPIFY(A, 1, n-1)
6.
return max
remakes heap
Running time: O(lgn)

23
HEAP-INCREASE-KEY
Goal:
Increases the key of an element i in the heap
Idea:
Increment the key of A[i] to its new value
If the max-heap property does not hold anymore:
traverse a path toward the root to find the proper
place for the newly increased key
16
14
8
Key [i] 15 2
i
4
10
7
1
24
Example: HEAP-INCREASE-KEY
16
14
8
2
i
4
16
10
14
3
8
2
10
i
15 1
Key [i ] 15
16
i
15
2
14
i
15
10
7
16
10
14
2
7
8
1
25
HEAP-INCREASE-KEY
Alg: HEAP-INCREASE-KEY(A, i, key)
1.
2.
3.
4.
5.
6.
if key < A[i]

then error new key is smaller than current key
A[i] key
16
while i > 1 and A[PARENT(i)] < A[i]
do exchange A[i] A[PARENT(i)]
14
i PARENT(i)
8
i
4
10
3
Key [i] 15
26
MAX-HEAP-INSERT
Goal:
16
Inserts a new element into a maxheap
Idea:
Expand the max-heap with a new
element whose key is -
Calls HEAP-INCREASE-KEY to
set the key of the new node to its
correct value and maintain the
max-heap property
14
10
8
2
7
4
-
16
14
10
8
2
7
4
15
27
Example: MAX-HEAP-INSERT
Insert value 15:
- Start by inserting -
Increase the key to 15

Call HEAP-INCREASE-KEY on A[11] = 15
16
16
14
8
2
7
4
14
10
3
2
10
7
15
The restored heap containing

the newly added element
16
16
14
8
2
15 9
4
15
10
10
3
2
14 9
4
7
28
MAX-HEAP-INSERT
Alg: MAX-HEAP-INSERT(A, key, n)
14
1. heap-size[A] n + 1
2. A[n + 1] -
16
10
8
2
7
4
3. HEAP-INCREASE-KEY(A, n + 1, key)
29
Summary
We can perform the following operations on
heaps:
MAX-HEAPIFY
O(lgn)
BUILD-MAX-HEAP
O(n)
HEAP-SORT
O(nlgn)
MAX-HEAP-INSERT
O(lgn)
HEAP-EXTRACT-MAX
O(lgn)
HEAP-INCREASE-KEY
O(lgn)
HEAP-MAXIMUM
O(1)
Average
O(lgn)
30
HeapSort Loop Invariant
31
Example:
14
14
16 9
2
7
10 8
14
10
16 9
2
7
10 8
14
3
5
10
i=1
1
16
16 9
10
2
7
4
8
14
16
9
10
10
2
7
4
8
16 9
i=2
5
10
10 14
i=3
5
10
16
i=4
i=5
1
10
14
9
10
10
3
32
LOOP INVARIANT
33
1.
n = length[A]
2.
for i n/2 downto 1
3.
34
Example:
14
14
16 9
2
7
10 8
14
10
16 9
2
7
10 8
14
3
5
10
i=1
1
16
16 9
10
2
7
4
8
14
16
9
10
10
2
7
4
8
16 9
i=2
5
10
10 14
i=3
5
10
16
i=4
i=5
1
10
14
9
10
10
3
35
Lesson from a HeapSort

Hi there!
Ang buhay ay parang heapsort

Merong mas mababa sayo
Meron din namang nasa itaas mo
Mas
magaling
ako!
36
Example:
A=[7, 4, 3, 1, 2]
Im on the
top of the
world
Pero tandaan mo, darating din ang panahon

Ikaw naman ang nasa tuktok nito.
37

Analysis of Heapsort

Uploaded by

Copyright:

Available Formats

Analysis of Heapsort

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Analysis of Heapsort

Uploaded by

Copyright:

Available Formats

Analysis of Algorithms

Min-heaps (smallest element at root), have the

Create a max-heap from an unordered array

Sort an array in place

Maintaining the Heap Property

Suppose a node is smaller than a

To eliminate the violation:

A[2] violates the heap property

A[4] violates the heap property

Heap property restored

Maintaining the Heap Property

MAX-HEAPIFY Running Time

Running time of MAX-HEAPIFY is O(lgn)

for i n/2 downto 1

Running Time of BUILD MAX HEAP

for i n/2 downto 1

Running time: O(nlgn)

Running Time of BUILD MAX HEAP

hi = h i height of the heap rooted at level i

Running Time of BUILD MAX HEAP

Cost of HEAPIFY at level i number of nodes at that level

Replace the values of ni and hi computed before

Multiply by 2h both at the nominator and denominator and

The sum above is smaller than the sum of all elements to

The sum above is smaller than 2

Running time of BUILD-MAX-HEAP: T(n) = O(n)

2. for i length[A] downto 2

do exchange A[1] A[i]

Running time: O(nlgn) --- Can be

Running time: O(1)

Exchange the root element with the last

Decrease the size of the heap by 1 element

Call MAX-HEAPIFY on the new root, on a heap of size n-1

Root is the largest element

Heap size decreased with 1

then error heap underflow

Running time: O(lgn)

if key < A[i]

Running time: O(lgn)

Inserts a new element into a maxheap

Increase the key to 15

The restored heap containing

HeapSort Loop Invariant

for i n/2 downto 1

Lesson from a HeapSort

Ang buhay ay parang heapsort

Pero tandaan mo, darating din ang panahon

You might also like