Chapter 6 PDF

1
Data Structures and Algorithms
BITS-Pilani K. K. Birla Goa Campus
1
Material for the presentation taken from Cormen, Leiserson, Rivest and
Stein, Introduction to Algorithms, Third Edition; 1
BITS-Pilani K. K. Birla Goa Campus Data Structures and Algorithms
Part II Sorting and Order Statistics
I Record : Collection of data

I Key : Value to be sorted
I Satellite data
I If satellite data is large, we permute an array of pointers to
the records.
2
Sorting algorithms
I In place sorting : If at any time only a constant number of

elements are stored outside the array.
3
Sorting algorithms

I MERGE procedure does not operate in place.
3
Sorting algorithms

I Ch 6 : Heapsort that uses a data structure called heap.
3
Sorting algorithms

I Ch 6 : Heapsort that uses a data structure called heap.
I Heapsort sorts n elements in place in O(n lg n) time.
3
Binary tree
I Binary tree is a tree data structure where each node can have
at most two child nodes : left child node and right child node.
4
Full Binary tree
I Each node is either a leaf node or has two child nodes.
5
Complete Binary tree
I Leaf nodes are at the same depth and all internal nodes have
2 child nodes
6
Complete Binary tree
I Leaf nodes are at the same depth and all internal nodes have
2 child nodes
6
Heap : nearly a complete binary tree
7
I All levels are completely filled except possibly the last level,
which is filled from the left
7
I Each node of the heap corresponds to an element of the array.
8
8
I A.length,
8
I A.length, A.heap-size,
8
I A.length, A.heap-size, Root : A[1]
8
Heap : parent, left child, right child
9
Binary Heaps
I Either max-heaps or min-heaps
10
Binary Heaps

I Max-heap property: A[PARENT (i)] ≥ A[i]
10
Binary Heaps

10
Binary Heaps

I A[1] contains the maximum element

10
Binary Heaps
I Min heap
11
Binary Heaps
I Min heap
I Min-heap property: A[PARENT (i)] ≤ A[i]
11
Binary Heaps
I Min heap
I Min-heap property: A[PARENT (i)] ≤ A[i]
I A[1] will contain the smallest element
11
Heap
I Height of a node : number of edges on the longest simple

downward path from the node to a leaf.
12
Heap

12
Heap

I Height of a heap is the height of its root.
12
Height of a heap
I Suppose a heap has n elements and has a height of h.
13
Height of a heap
13
Height of a heap
2h
13
Height of a heap
2h ≤ n
13
Height of a heap
2h ≤ n ≤ 2h+1 − 1
13
Height of a heap
2h ≤ n ≤ 2h+1 − 1
2h ≤ n < 2h+1
13
Height of a heap
2h ≤ n ≤ 2h+1 − 1
2h ≤ n < 2h+1
h ≤ lg n < (h + 1)
13
Height of a heap
2h ≤ n ≤ 2h+1 − 1
2h ≤ n < 2h+1
h ≤ lg n < (h + 1)
h = blg nc
13
MAX-HEAPIFY: Maintaining the heap property
I MAX-HEAPIFY(A,i) : binary trees rooted at LEFT(i) and

RIGHT(i) satisfy max-heap property.
14
15
16
MAX-HEAPIFY: Finding recurrence
I Let the tree rooted at i have n nodes. The child subtree will
have a size at most 2n/3
17
17
h = height of node i
Maximum size of child subtree = 2h − 1
17
Maximum fraction of nodes =

17
2h − 1
2h − 1 + 2h−1
17
2h − 1
2h − 1 + 2h−1
18
2h − 1
2h − 1 + 2h−1
a a+1
For b > a > 0 , a > 0 , a > 0 , a > 0 , a > 0 , a > 0 , <
b b+1
2h − 1 2h
<
2h − 1 + 2h−1 2h + 2h−1
2 × 2h−1 2
= =
(2 + 1) × 2h−1 3
2n
Maximum size of child subtree <
3
18
19
MAX-HEAPIFY: Running time
I T (n) ≤ T (2n/3) + Θ(1)
20
I T (n) ≤ T (2n/3) + Θ(1)

log 3 1
nlogb a = n 2 = Θ(1)
20
I T (n) ≤ T (2n/3) + Θ(1)

log 3 1
logb a
Θ(n ) = Θ(f (n))
20
I T (n) ≤ T (2n/3) + Θ(1)

log 3 1
logb a
Θ(n ) = Θ(f (n))
logb a
Soln. Θ(n lg n)
20
I T (n) ≤ T (2n/3) + Θ(1)

log 3 1
logb a
Θ(n ) = Θ(f (n))
logb a
Soln. Θ(n lg n) = Θ(lg n)
20
I T (n) ≤ T (2n/3) + Θ(1)

log 3 1
logb a
Θ(n ) = Θ(f (n))
logb a
Soln. Θ(n lg n) = Θ(lg n)
T (n) = O(lg n)
20
BUILD-MAX-HEAP : Building a heap
I Convert an unordered array into a max-heap using

MAX-HEAPIFY
21
I Convert an unordered array into a max-heap using

MAX-HEAPIFY
21
22
22
22
BUILD-MAX-HEAP : Running time
23
Running time:
23
Running time: O(n lg n)
23
Running time: O(n lg n) { Not asymptotically tight }
23
l n m
Nodes with height h ≤ h+1
2
24
l n m
2
l n m
I There are at most nodes having a height h.
2h+1
24
l n m
2
l n m
2h+1
h = 0,
24
l n m
2
l n m
2h+1

10
h = 0,
20+1
24
l n m
2
l n m
2h+1

10
h = 0, = 5;
20+1
24
l n m
2
l n m
2h+1

10
h = 0, = 5; h = 1,
20+1
24
l n m
2
l n m
2h+1

10 10
h = 0, = 5; h = 1, =3
20+1 21+1
24
l n m
2
l n m
2h+1

10 10
h = 0, = 5; h = 1, =3
20+1 21+1
h = 2,
24
l n m
2
l n m
2h+1

10 10
h = 0, = 5; h = 1, =3
20+1 21+1

10
h = 2, = 2;
22+1
24
l n m
2
l n m
2h+1

10 10
h = 0, = 5; h = 1, =3
20+1 21+1

10
h = 2, = 2; h = 3,
22+1
24
l n m
2
l n m
2h+1

10 10
h = 0, = 5; h = 1, =3
20+1 21+1

10 10
h = 2, = 2; h = 3, =1
22+1 23+1
24
l n m
2
I Proof by Induction
25
l n m
2
I Base case: h = 0
25
l n m
2
I Base case: h = 0 lnm
Number of nodes having zero height =
2
25
l n m
2
I Base case: h = 0 lnm l n m
Number of nodes having zero height = ≤ h+1
2 2
25
l n m
2
2 2
I Inductive step: l n m
Assume that there are at most (h−1)+1 number of nodes
2
of height h − 1.
25
l n m
2
2 2
2
of height h − 1.
Let kh be the number of nodes of height h in the binary heap
T.
25
l n m
2
2 2
2
of height h − 1.
T.
Let us construct a new heap T 0 by removing all leaf nodes
from T
25
l n m
2
2 2
2
of height h − 1.
T.
from T
0
kh = kh−1
25
l n m
2
2 2
2
of height h − 1.
T.
from T
n0

0
kh = kh−1 ≤ (h−1)+1
2
25
l n m
2
2 2
2
of height h − 1.
T.
from T
n0

0 b(n/2)c
kh = kh−1 ≤ (h−1)+1 = (h−1)+1
2 2
25
l n m
2
2 2
2
of height h − 1.
T.
from T
n0

0 b(n/2)c
kh = kh−1 ≤ (h−1)+1 = (h−1)+1
2 2

(n/2)
≤
2h
25
l n m
2
2 2
2
of height h − 1.
T.
from T
n0

0 b(n/2)c
kh = kh−1 ≤ (h−1)+1 = (h−1)+1
2 2
l
(n/2) n m
≤ =
2h 2h+1
25
26
blg nc l
X n m
h+1
O(h)
2
h=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
∞
X
kx k
k=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
∞
X x
kx k =
(1 − x)2
k=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
∞
X x
kx k =
(1 − x)2
k=0
∞
X
k(1/2)k
k=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
∞
X x
kx k =
(1 − x)2
k=0
∞
X 1/2
k(1/2)k =
(1 − (1/2))2
k=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n
2h+1 2h
h=0 h=0
∞
X x
kx k =
(1 − x)2
k=0
∞
X 1/2
k(1/2)k = =2
(1 − (1/2))2
k=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n 
2h+1 2h
h=0 h=0
∞
!
X h
=O n
2h
h=0
26
 
blg nc l blg nc
X n m X h
O(h) = O n 
2h+1 2h
h=0 h=0
∞
!
X h
=O n
2h
h=0
= O(2n)
26
 
blg nc l blg nc
X n m X h
O(h) = O n 
2h+1 2h
h=0 h=0
∞
!
X h
=O n
2h
h=0
= O(2n) = O(n)
26
P∞ k x
k=0 kx = (1−x)2
27
P∞ k x
k=0 kx = (1−x)2
I 0<x <1, 1 + x + x2 + . . .
27
P∞ k x
k=0 kx = (1−x)2
1
I 0<x <1, 1 + x + x2 + . . . =
1−x
27
P∞ k x
k=0 kx = (1−x)2
1
I 0<x <1, 1 + x + x2 + . . . =
1−x
∞
X 1
I xk =
1−x
k=0
27
P∞ k x
k=0 kx = (1−x)2
1
I 0<x <1, 1 + x + x2 + . . . =
1−x
∞
X 1
I xk =
1−x
k=0
I Differentiating both sides w.r.t x
∞
X 1
kx k−1 =
(1 − x)2
k=0
27
P∞ k x
k=0 kx = (1−x)2
1
I 0<x <1, 1 + x + x2 + . . . =
1−x
∞
X 1
I xk =
1−x
k=0
I Differentiating both sides w.r.t x
∞
X 1
kx k−1 =
(1 − x)2
k=0
I Multiplying x on both sides

∞
X x
kx k =
(1 − x)2
k=0
27
Heap
I We can construct a max heap (or a min heap) from an

unordered array in O(n) time.
28
Heapsort
29
Heapsort
I Running time : O(n lg n)
29
Heapsort
I Running time : O(n lg n)

I Operation (P. 161)
29
Priority Queues
I Heap data structure can be used to construct efficient priority

queue
30
Priority Queues

queue
I Job scheduling
30
Priority Queues

queue
I Job scheduling
I Two forms : max-priority queue and min priority-queue
30
Priority Queues

queue
I Job scheduling
I Max-priority queue operations:
30
Priority Queues

queue
I Job scheduling
1. Insert(S,x)
30
Priority Queues

queue
I Job scheduling
1. Insert(S,x)
2. Maximum(S)
30
Priority Queues

queue
I Job scheduling
1. Insert(S,x)
2. Maximum(S)
3. Extract-Max(S)
30
Priority Queues

queue
I Job scheduling
1. Insert(S,x)
2. Maximum(S)
3. Extract-Max(S)
4. Increase-Key(S,x,k)
30
Priority Queues
31
Priority Queues
31
Priority Queues
Running time of Heap-Extract-Max : O(lg n)

31
Heap-Increase-Key
32
Heap-Increase-Key
33
Heap-Increase-Key
I Suppose we increase the value at index i to 15.
33
Heap-Increase-Key
I Suppose we increase the value at index i to 15.

I Running time of Heap-Increase-Key : O(lg n)
33
Max-Heap-Insert
34
Max-Heap-Insert
Running time of Heap-Increase-Key : O(lg n)
34
Priority Queue
I Using a heap, all the basic operations can be performed in

O(lg n) time.
35
I
36

Chapter 6 PDF

Uploaded by

Document Information

Original Description:

Original Title

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

Chapter 6 PDF

Uploaded by

Copyright:

Available Formats

1

Data Structures and Algorithms

BITS-Pilani K. K. Birla Goa Campus

I Record : Collection of data

I In place sorting : If at any time only a constant number of

I In place sorting : If at any time only a constant number of

I In place sorting : If at any time only a constant number of

I In place sorting : If at any time only a constant number of

I Each node is either a leaf node or has two child nodes.

I Each node of the heap corresponds to an element of the array.

I Each node of the heap corresponds to an element of the array.

I Each node of the heap corresponds to an element of the array.

I Each node of the heap corresponds to an element of the array.

I Each node of the heap corresponds to an element of the array.

I A.length, A.heap-size, Root : A[1]

I Either max-heaps or min-heaps

I Either max-heaps or min-heaps

I Either max-heaps or min-heaps

I Either max-heaps or min-heaps

I A[1] contains the maximum element

I Height of a node : number of edges on the longest simple

I Height of a node : number of edges on the longest simple

I Height of a node : number of edges on the longest simple

I Height of a heap is the height of its root.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I Suppose a heap has n elements and has a height of h.

I MAX-HEAPIFY(A,i) : binary trees rooted at LEFT(i) and

Maximum fraction of nodes =

I T (n) ≤ T (2n/3) + Θ(1)

I T (n) ≤ T (2n/3) + Θ(1)

I T (n) ≤ T (2n/3) + Θ(1)

I T (n) ≤ T (2n/3) + Θ(1)

I T (n) ≤ T (2n/3) + Θ(1)

I T (n) ≤ T (2n/3) + Θ(1)

I Convert an unordered array into a max-heap using

I Convert an unordered array into a max-heap using

Running time: O(n lg n)

Running time: O(n lg n) { Not asymptotically tight }

I Multiplying x on both sides

I We can construct a max heap (or a min heap) from an

I Running time : O(n lg n)

I Running time : O(n lg n)

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

I Heap data structure can be used to construct efficient priority

Running time of Heap-Extract-Max : O(lg n)

I Suppose we increase the value at index i to 15.

I Suppose we increase the value at index i to 15.

Running time of Heap-Increase-Key : O(lg n)

I Using a heap, all the basic operations can be performed in

You might also like