Transcript Chapter 2--Basic Data Structures

CSC401 – Analysis of Algorithms
Chapter 2
Basic Data Structures
Objectives:
Introduce basic data structures, including
–
–
–
–
–
Stacks and Queues
Vectors, Lists, and Sequences
Trees
Priority Queues and Heaps
Dictionaries and Hash Tables
Analyze the performance of operations on
basic data structures
Abstract Data Types (ADTs)
An abstract
data type (ADT)
is an
abstraction of a
data structure
An ADT
specifies:
– Data stored
– Operations on
the data
– Error conditions
associated with
operations
Example: ADT modeling
a simple stock trading
system
– The data stored are
buy/sell orders
– The operations supported
are
order buy(stock, shares,
price)
order sell(stock, shares,
price)
void cancel(order)
– Error conditions:
Buy/sell a nonexistent stock
2-2
Cancel a nonexistent order
The Stack ADT
The Stack ADT stores arbitrary
objects
Insertions and deletions follow
the last-in first-out scheme
Think of a spring-loaded plate
dispenser
Main stack operations:
– push(object): inserts an element
– object pop(): removes and
returns the last inserted element
Auxiliary stack operations:
– object top(): returns the last
inserted element without
removing it
– integer size(): returns the
number of elements stored
– boolean isEmpty(): indicates
whether no elements are stored
Attempting the
execution of an
operation of ADT may
sometimes cause an
error condition, called
an exception
Exceptions are said to
be “thrown” by an
operation that cannot
be executed
In the Stack ADT,
operations pop and top
cannot be performed if
the stack is empty
Attempting the execution
of pop or top on an
empty stack throws an
EmptyStackException 2-3
Applications of Stacks
Direct applications
– Page-visited history in a Web
browser
– Undo sequence in a text editor
– Chain of method calls in the
Java Virtual Machine
The Java Virtual Machine (JVM)
keeps track of the chain of active
methods with a stack
When a method is called, the JVM
pushes on the stack a frame
containing
– Local variables and return value
– Program counter, keeping track of
the statement being executed
When a method ends, its frame is
popped from the stack and
control is passed to the method
on top of the stack
Indirect applications
– Auxiliary data structure
for algorithms
– Component of other
data structures
main() {
int i = 5;
foo(i);
}
foo(int j) {
int k;
k = j+1;
bar(k);
}
bar(int m) {
…
}
bar
PC = 1
m=6
foo
PC = 3
j=5
k=6
main
PC = 2
i=5
2-4
Array-based Stack
A simple way of
implementing the Stack
ADT uses an array
We add elements from
left to right
A variable keeps track of
the index of the top
element
The array storing the
stack elements may
become full
A push operation will then
throw a FullStackException
– Limitation of the arraybased implementation
– Not intrinsic to the Stack
ADT
Algorithm size()
return t + 1
Algorithm pop()
if isEmpty() then
throw EmptyStackException
else
tt1
return S[t + 1]
Algorithm push(o)
if t = S.length  1 then
throw FullStackException
else
tt+1
S[t]  o
Performance
– Let n be the number of
elements in the stack
– The space used is O(n)
– Each operation runs in time O(1)
Limitations
– The fixed maximum size
– Trying to push a new
element into a full stack
causes an implementation2-5
specific exception
Stack Interface & ArrayStack in Java
public interface Stack {
public int size();
public class ArrayStack implements Stack {
private Object S[ ];
private int top = -1;
public boolean isEmpty();
public ArrayStack(int capacity) {
S = new Object[capacity]);
}
public Object top()
throws EmptyStackException;
public void push(Object o);
}
public Object pop()
throws EmptyStackException {
if isEmpty()
throw new EmptyStackException
(“Empty stack: cannot pop”);
Object temp = S[top];
S[top] = null;
top = top – 1;
return temp;
}
public Object pop()
throws EmptyStackException;
Other Implementations
of Stack
– Extendable array-based
stack
– Linked list-based stack
}
2-6
The Queue ADT
The Queue ADT stores
arbitrary objects
Insertions and deletions
follow the first-in first-out
scheme
Insertions are at the rear
and removals at the front
Main queue operations:
– enqueue(object): inserts
an element at the end of
the queue
– object dequeue():
removes and returns the
element at the front
Direct applications
– Waiting lists, bureaucracy
– Access to shared
resources (e.g., printer)
– Multiprogramming
Auxiliary queue operations:
– object front(): returns the
element at the front without
removing it
– integer size(): returns the
number of elements stored
– boolean isEmpty(): indicates
whether no elements are stored
Exceptions
– Attempting the execution of
dequeue or front on an empty
queue throws an
EmptyQueueException
Indirect applications
– Auxiliary data structure for
algorithms
– Component of other data
structures
2-7
Array-based Queue
Use an array of size N in a circular fashion
Two variables keep track of the front and rear
f index of the front element
r index immediately past the rear element
Array location r is kept empty
normal configuration
Q
0 1 2
f
r
wrapped-around configuration
Q
0 1 2
r
f
2-8
Array-based Queue Operations
We use the modulo
operator (remainder of
division)
Operation enqueue
throws an exception if
the array is full
This exception is
implementationdependent
Operation dequeue
throws an exception if
the queue is empty
This exception is
specified in the queue
ADT
Algorithm size()
return (N  f + r) mod N
Algorithm isEmpty()
return (f = r)
Algorithm enqueue(o)
if size() = N  1 then
throw FullQueueException
else
Q[r]  o
r  (r + 1) mod N
Algorithm dequeue()
if isEmpty() then
throw EmptyQueueException
else
o  Q[f]
f  (f + 1) mod N
return o
2-9
Queue Interface in Java
Java interface
corresponding to our
Queue ADT
Requires the
definition of class
EmptyQueueException
No corresponding
built-in Java class
public interface Queue {
public int size();
public boolean isEmpty();
public Object front()
throws EmptyQueueException;
public void enqueue(Object o);
}
public Object dequeue()
throws EmptyQueueException;
Other Implementations of Queue
– Extendable array-based queue: The enqueue
operation has amortized running time
O(n) with the incremental strategy
O(1) with the doubling strategy
– Linked list-based queue
2-10
The Vector ADT
The Vector ADT extends the
notion of array by storing a
sequence of arbitrary
objects
An element can be
accessed, inserted or
removed by specifying its
rank (number of elements
preceding it)
An exception is thrown if an
incorrect rank is specified
(e.g., a negative rank)
Direct applications
– Sorted collection of objects
(elementary database)
Indirect applications
Main vector operations:
– object elemAtRank(integer r):
returns the element at rank r
without removing it
– object replaceAtRank(integer
r, object o): replace the
element at rank with o and
return the old element
– insertAtRank(integer r, object
o): insert a new element o to
have rank r
– object removeAtRank(integer
r): removes and returns the
element at rank r
Additional operations size() and
isEmpty()
– Auxiliary data structure for algorithms
– Component of other data structures
2-11
Array-based Vector
Use an array V of size N
A variable n keeps track of the size of the
vector (number of elements stored)
Operation elemAtRank(r) is implemented in
O(1) time by
V
returning V[r]
0 1 2
n
r
In operation insertAtRank(r, o), we need to make
room for the new element by shifting forward the
n  r elements V[r], …, V[n  1]
In the worst
V
case (r = 0),
0 1 2
n
r
this takes
V
O(n) time
0 1 2
n
r
V
o
0 1 2
n
r
2-12
Array-based Vector
In operation removeAtRank(r), we need to fill the
hole left by the removed element by shifting
backward the n  r  1 elements V[r + 1], …, V[n  1]
In the worst
V
o
case (r = 0),
0 1 2
n
r
this takes
V
O(n) time
0 1 2
n
r
V
Performance
0 1 2
n
r
– In the array based implementation of a Vector
The space used by the data structure is O(n)
size, isEmpty, elemAtRank and replaceAtRank run in O(1) time
insertAtRank and removeAtRank run in O(n) time
– If we use the array in a circular fashion, insertAtRank(0) and
removeAtRank(0) run in O(1) time
– In an insertAtRank operation, when the array is full, instead
of throwing an exception, we can replace the array with a
2-13
larger one (extendable array)
Singly Linked List
A singly linked list is a concrete data
structure consisting of a sequence of
nodes
Each node stores
– element
– link to the next node
next
node
elem

A
B
Stack with singly linked list
C
D
– The top element is stored at the first node of the list
– The space used is O(n) and each operation of the Stack ADT
takes O(1) time
Queue with singly linked list
– The front element is stored at the first node
– The rear element is stored at the last node
– The space used is O(n) and each operation of the Queue
ADT takes O(1) time
2-14
Position ADT & List ADT
The Position ADT
– models the notion of place within a data structure where a
single object is stored
– gives a unified view of diverse ways of storing data, such as
a cell of an array
a node of a linked list
– Just one method:
object element(): returns the element stored at the position
The List ADT
–
–
–
–
–
–
models a sequence of positions storing arbitrary objects
establishes a before/after relation between positions
Generic methods:
size(), isEmpty()
Query methods:
isFirst(p), isLast(p)
Accessor methods:
first(), last(), before(p), after(p)
Update methods:
replaceElement(p, o), swapElements(p, q)
insertBefore(p, o), insertAfter(p, o)
insertFirst(o), insertLast(o)
remove(p)
2-15
Doubly Linked List
A doubly linked list provides a natural
implementation of the List ADT
Nodes implement Position and store:
– element
– link to the previous node
– link to the next node
prev
next
elem
node
Special trailer and header nodes
header
nodes/positions
trailer
elements
2-16
Doubly Linked List Operations
We visualize insertAfter(p,
X), which returns position q
p
A
p
A
p
B
C
q
B
p
A
We visualize remove(p),
where p = last()
B
A
C
A
B
B
C
C
X
q
X
D
p
D
C
A
B
C
Performance
–
–
–
–
The space used by a doubly linked list with n elements is O(n)
The space used by each position of the list is O(1)
All the operations of the List ADT run in O(1) time
Operation element() of the Position ADT runs in O(1) time
2-17
Sequence ADT
The Sequence ADT is the
union of the Vector and
List ADTs
Elements accessed by
– Rank or Position
Generic methods:
– size(), isEmpty()
Vector-based methods:
– elemAtRank(r),
replaceAtRank(r, o),
insertAtRank(r, o),
removeAtRank(r)
The Sequence ADT is a
basic, general-purpose,
data structure for storing
an ordered collection of
elements
List-based methods:
– first(), last(),
before(p), after(p),
replaceElement(p, o),
swapElements(p, q),
insertBefore(p, o),
insertAfter(p, o),
insertFirst(o),
insertLast(o),
remove(p)
Bridge methods:
– atRank(r), rankOf(p)
Direct applications:
– Generic replacement for stack,
queue, vector, or list
– small database
Indirect applications:
– Building block of more complex
2-18
data structures
Array-based Implementation
We use a
circular array
storing
positions
A position
object stores:
– Element
– Rank
elements
0
1
2
3
positions
Indices f and l
keep track of
first and last
S
positions
f
l
2-19
Sequence Implementations
Operation
size, isEmpty
atRank, rankOf, elemAtRank
first, last, before, after
replaceElement, swapElements
replaceAtRank
insertAtRank, removeAtRank
insertFirst, insertLast
insertAfter, insertBefore
remove
Array
1
1
1
1
1
n
1
n
n
List
1
n
1
1
n
n
1
1
1
2-20
Design Patterns
Adaptor
Position
Composition
Iterator
Comparator
Locator
2-21
Design Pattern: Iterators
An iterator abstracts the
process of scanning
through a collection of
elements
Methods of the
ObjectIterator ADT:
–
–
–
–
object object()
boolean hasNext()
object nextObject()
reset()
Extends the concept of
Position by adding a
traversal capability
Implementation with an
array or singly linked list
An iterator is typically
associated with an
another data structure
We can augment the
Stack, Queue, Vector, List
and Sequence ADTs with
method:
– ObjectIterator
elements()
Two notions of iterator:
– snapshot: freezes the
contents of the data
structure at a given time
– dynamic: follows
changes to the data
structure
2-22
The Tree Structure
In computer science, a
tree is an abstract model
of a hierarchical structure
A tree consists of nodes
with a parent-child
relation
Applications:
US
– Organization charts
– File systems
Europe
– Programming
environments
Computers”R”Us
Sales
Manufacturing
International
Asia
Laptops
R&D
Desktops
Canada
2-23
Tree Terminology
Root: node without parent (A)
Internal node: node with at least
one child (A, B, C, F)
External node (a.k.a. leaf ): node
without children (E, I, J, K, G, H,
D)
Ancestors of a node: parent,
grandparent, grand-grandparent,
etc.
Depth of a node: number of
ancestors
Height of a tree: maximum depth E
of any node (3)
Descendant of a node: child,
grandchild, grand-grandchild, etc.
Subtree: tree consisting
of a node and its
descendants
A
B
C
F
I
J
G
K
D
H
subtree
2-24
Tree ADT
We use positions to
abstract nodes
Generic methods:
–
–
–
–
integer size()
boolean isEmpty()
objectIterator elements()
positionIterator positions()
Accessor methods:
– position root()
– position parent(p)
– positionIterator
children(p)
Query methods:
– boolean isInternal(p)
– boolean isExternal(p)
– boolean isRoot(p)
Update methods:
– swapElements(p, q)
– object replaceElement(p, o)
Additional update methods
may be defined by data
structures implementing the
Tree ADT
2-25
The Tree Structure
In computer science, a
tree is an abstract model
of a hierarchical structure
A tree consists of nodes
with a parent-child
relation
Applications:
US
– Organization charts
– File systems
Europe
– Programming
environments
Computers”R”Us
Sales
Manufacturing
International
Asia
Laptops
R&D
Desktops
Canada
2-26
Tree Terminology
Root: node without parent (A)
Internal node: node with at least
one child (A, B, C, F)
External node (a.k.a. leaf ): node
without children (E, I, J, K, G, H,
D)
Ancestors of a node: parent,
grandparent, grand-grandparent,
etc.
Depth of a node: number of
ancestors
Height of a tree: maximum depth E
of any node (3)
Descendant of a node: child,
grandchild, grand-grandchild, etc.
Subtree: tree consisting
of a node and its
descendants
A
B
C
F
I
J
G
K
D
H
subtree
2-27
Tree ADT
We use positions to
abstract nodes
Generic methods:
–
–
–
–
integer size()
boolean isEmpty()
objectIterator elements()
positionIterator positions()
Accessor methods:
– position root()
– position parent(p)
– positionIterator
children(p)
Query methods:
– boolean isInternal(p)
– boolean isExternal(p)
– boolean isRoot(p)
Update methods:
– swapElements(p, q)
– object replaceElement(p, o)
Additional update methods
may be defined by data
structures implementing the
Tree ADT
2-28
Depth and Height
Depth -- the depth of v is
the number of ancestors,
excluding v itself
– the depth of the root is 0
– the depth of v other than
the root is one plus the
depth of its parent
– time efficiency is O(1+d)
Height -- the height of a
subtree v is the maximum
depth of its external nodes
– the height of an external
node is 0
– the height of an internal
node v is one plus the
maximum height of its
children
– time efficiency is O(n)
Algorithm depth(T,v)
if T.isRoot(v) then
return 0
else return
1+depth(T, T.parent(v))
Algorithm height(T,v)
if T.isExternal(v) then
return 0
else
h=0;
for each wT.children(v) do
h=max(h, height(T,w))
return 1+h
2-29
Preorder Traversal
A traversal visits the nodes of a
tree in a systematic manner
In a preorder traversal, a node
is visited before its descendants
The running time is O(n)
Application: print a structured
document
1
Algorithm preOrder(v)
visit(v)
for each child w of v
preorder (w)
Make Money Fast!
2
5
1. Motivations
9
2. Methods
3
4
1.1 Greed
1.2 Avidity
6
2.1 Stock
Fraud
7
2.2 Ponzi
Scheme
References
8
2.3 Bank
Robbery
2-30
Postorder Traversal
In a postorder traversal, a
node is visited after its
descendants
The running time is O(n)
Application: compute space
used by files in a directory and
its subdirectories
9
Algorithm postOrder(v)
for each child w of v
postOrder (w)
visit(v)
cs16/
3
8
7
homeworks/
todo.txt
1K
programs/
1
2
h1c.doc
3K
h1nc.doc
2K
4
DDR.java
10K
5
Stocks.java
25K
6
Robot.java
20K
2-31
Binary Tree
A binary tree is a tree with
the following properties:
Applications:
– arithmetic
expressions
– decision processes
– searching
– Each internal node has two
children
– The children of a node are an
ordered pair
We call the children of an
internal node left child and
right child
Alternative recursive
definition: a binary tree is
either
– a tree consisting of a single
node, or
– a tree whose root has an
ordered pair of children, each
of which is a binary tree
A
B
C
D
E
H
F
G
I
2-32
Binary Tree Examples
Arithmetic expression
binary tree
– internal nodes: operators
– external nodes: operands
– Example: arithmetic
expression tree for the
expression (2(a1)+(3  b))
+



2
a
Decision tree
3
b
1
– internal nodes: questions with yes/no answer
– external nodes: decisions
– Example: dining decision
Want a fast meal?
No
Yes
How about coffee?
Yes
Starbucks
No
Spike’s
On expense account?
Yes
Al Forno
No
Café Paragon 2-33
Properties of Binary Trees
Notation
n number of nodes
e number of external
nodes
i number of internal
nodes
h height
Properties:
– e=i+1
– n = 2e  1
– hi
– h  (n  1)/2
– h+1  e  2h
– h  log2 e
– h  log2 (n + 1)  1
2-34
BinaryTree ADT
The BinaryTree ADT extends the Tree
ADT, i.e., it inherits all the methods of
the Tree ADT
Additional methods:
– position leftChild(p)
– position rightChild(p)
– position sibling(p)
Update methods may be defined by data
structures implementing the BinaryTree
ADT
2-35
Inorder Traversal
In an inorder traversal a
node is visited after its left
subtree and before its
right subtree
Time efficiency is O(n)
Application: draw a binary
tree
Algorithm inOrder(v)
if isInternal (v)
inOrder (leftChild (v))
visit(v)
if isInternal (v)
inOrder (rightChild (v))
– x(v) = inorder rank of v
– y(v) = depth of v
6
2
8
1
4
3
7
9
5
2-36
Print Arithmetic Expressions
Specialization of an inorder
traversal
– print operand or operator
when visiting node
– print “(“ before traversing
left subtree
– print “)“ after traversing
right subtree
+



2
a
3
b
Algorithm printExpression(v)
if isInternal (v)
print(“(’’)
inOrder (leftChild (v))
print(v.element ())
if isInternal (v)
inOrder (rightChild (v))
print (“)’’)
((2  (a  1)) + (3  b))
1
2-37
Evaluate Arithmetic Expressions
Specialization of a
postorder traversal
– recursive method
returning the value of a
subtree
– when visiting an internal
node, combine the
values of the subtrees
Algorithm evalExpr(v)
if isExternal (v)
return v.element ()
else
x  evalExpr(leftChild (v))
y  evalExpr(rightChild (v))
  operator stored at v
return x  y
+



2
5
3
1
2
2-38
Euler Tour Traversal
Generic traversal of a binary tree
Includes a special cases the preorder, postorder and inorder
traversals
Walk around the tree and visit each node three times:
– on the left (preorder)
– from below (inorder)
– on the right (postorder)
+
L
2


R
B

5
3
2
1
2-39
Template Method Pattern
Generic algorithm that
public abstract class EulerTour {
can be specialized by
protected BinaryTree tree;
redefining certain steps
protected void visitExternal(Position p, Result r) { }
Implemented by means
protected void visitLeft(Position p, Result r) { }
of an abstract Java class
protected void visitBelow(Position p, Result r) { }
Visit methods that can
protected void visitRight(Position p, Result r) { }
be redefined by
protected Object eulerTour(Position p) {
subclasses
Result r = new Result();
Template method eulerTour
if tree.isExternal(p) { visitExternal(p, r); }
– Recursively called on
the left and right
children
– A Result object with
fields leftResult, rightResult
and finalResult keeps track
of the output of the
recursive calls to eulerTour
else {
visitLeft(p, r);
r.leftResult = eulerTour(tree.leftChild(p));
visitBelow(p, r);
r.rightResult = eulerTour(tree.rightChild(p));
visitRight(p, r);
return r.finalResult;
}…
2-40
Specializations of EulerTour
We show how to
specialize class
EulerTour to evaluate
an arithmetic
expression
Assumptions
public class EvaluateExpression
extends EulerTour {
protected void visitExternal(Position p, Result r) {
r.finalResult = (Integer) p.element();
}
protected void visitRight(Position p, Result r) {
Operator op = (Operator) p.element();
r.finalResult = op.operation(
(Integer) r.leftResult,
(Integer) r.rightResult
);
}
– External nodes store
Integer objects
– Internal nodes store
Operator objects
supporting method
operation (Integer, Integer)
…
}
2-41
Data Structure for Trees
A node is represented
by an object storing

– Element
– Parent node
– Sequence of children
nodes
B
Node objects
implement the Position
ADT


A
D
F
B
D
A
C
F
E

C

E
2-42
Data Structure for Binary Trees
A node is represented
by an object storing
–
–
–
–
Element
Parent node
Left child node
Right child node

B
Node objects implement
the Position ADT


B
A
A
D
D

C
E

C


E
2-43
Vector-Based Binary Tree
Level numbering of nodes of T: p(v)
– if v is the root of T, p(v)=1
– if v is the left child of u, p(v)=2p(u)
– if v is the right child of u, p(v)=2p(u)+1
Vector S storing the nodes of T by putting
the root at the second position and
following the above level numbering
Properties: Let n be the number of nodes of T,
N be the size of the vector S, and PM be the
maximum value of p(v) over all the nodes of T
– N=PM+1
– N=2^((n+1)/2)
2-44
Java Implementation
Tree interface
BinaryTree interface
extending Tree
Classes implementing
Tree and BinaryTree
and providing
expandExternal(v)
v
A
A

– Constructors
– Update methods
– Print methods
Examples of updates
for binary trees
B
– expandExternal(v)
– removeAboveExternal(w)
v

removeAboveExternal(w)
A
B
C
w
2-45
Trees in JDSL
JDSL is the Library of Data
Structures in Java
Tree interfaces in JDSL
–
–
–
–
InspectableBinaryTree
InspectableTree
BinaryTree
Tree
Inspectable versions of the
interfaces do not have
update methods
Tree classes in JDSL
– NodeBinaryTree
– NodeTree
JDSL was developed at
Brown’s Center for
Geometric Computing
See the JDSL
documentation and
tutorials at http://jdsl.org
InspectableTree
Tree
InspectableBinaryTree
BinaryTree
2-46
Priority Queue ADT
A priority queue stores
a collection of items
An item is a pair
(key, element)
Main methods of the
Priority Queue ADT
– insertItem(k, o) -inserts an item with key
k and element o
– removeMin() -- removes
the item with smallest
key and returns its
element
Additional methods
– minKey(k, o) -- returns,
but does not remove, the
smallest key of an item
– minElement() -- returns,
but does not remove, the
element of an item with
smallest key
– size(), isEmpty()
Applications:
– Standby flyers
– Auctions
– Stock market
2-47
Total Order Relation
Keys in a priority
queue can be
arbitrary objects
on which an
order is defined
Two distinct
items in a
priority queue
can have the
same key
Mathematical concept
of total order relation

– Reflexive property:
xx
– Antisymmetric
property:
xy  yx x=y
– Transitive property:
xy  yz xz
2-48
Comparator ADT
A comparator
encapsulates the action of
comparing two objects
according to a given total
order relation
A generic priority queue
uses an auxiliary
comparator
The comparator is
external to the keys being
compared
When the priority queue
needs to compare two
keys, it uses its
comparator
Methods of the
Comparator ADT, all
with Boolean return
type
– isLessThan(x, y)
– isLessThanOrEqualTo(x,
y)
– isEqualTo(x,y)
– isGreaterThan(x, y)
– isGreaterThanOrEqualTo
(x,y)
– isComparable(x)
2-49
Sorting with a Priority Queue
We can use a priority
queue to sort a set of
comparable elements
– Insert the elements
one by one with a
series of insertItem(e,
e) operations
– Remove the elements
in sorted order with a
series of removeMin()
operations
The running time of
this sorting method
depends on the
priority queue
implementation
Algorithm PQ-Sort(S, C)
Input sequence S, comparator C
for the elements of S
Output sequence S sorted in
increasing order according to C
P  priority queue with
comparator C
while S.isEmpty ()
e  S.remove (S. first ())
P.insertItem(e, e)
while P.isEmpty()
e  P.removeMin()
S.insertLast(e)
2-50
Sequence-based Priority Queue
Implementation with
an unsorted sequence
– Store the items of the
priority queue in a listbased sequence, in
arbitrary order
Performance:
– insertItem takes O(1)
time since we can insert
the item at the beginning
or end of the sequence
– removeMin, minKey and
minElement take O(n)
time since we have to
traverse the entire
sequence to find the
smallest key
Implementation with a
sorted sequence
– Store the items of the
priority queue in a
sequence, sorted by
key
Performance:
– insertItem takes O(n)
time since we have to
find the place where to
insert the item
– removeMin, minKey and
minElement take O(1)
time since the smallest
key is at the beginning
of the sequence
2-51
Selection-Sort
Selection-sort is the variation of PQ-sort
where the priority queue is implemented with
an unsorted sequence
Running time of Selection-sort:
– Inserting the elements into the priority queue with
n insertItem operations takes O(n) time
– Removing the elements in sorted order from the
priority queue with n removeMin operations takes
time proportional to
1 + 2 + …+ n
Selection-sort runs in O(n2) time
2-52
Insertion-Sort
Insertion-sort is the variation of PQ-sort
where the priority queue is implemented
with a sorted sequence
Running time of Insertion-sort:
–
Inserting the elements into the priority queue with
n insertItem operations takes time proportional to
1 + 2 + …+ n
–
Removing the elements in sorted order from the
priority queue with a series of n removeMin
operations takes O(n) time
Insertion-sort runs in O(n2) time
2-53
In-place Insertion-sort
Instead of using an
external data structure,
we can implement
selection-sort and
insertion-sort in-place
A portion of the input
sequence itself serves as
the priority queue
For in-place insertion-sort
5
4
2
3
1
5
4
2
3
1
4
5
2
3
1
2
4
5
3
1
– We keep sorted the initial
portion of the sequence
– We can use
swapElements instead of
modifying the sequence
2
3
4
5
1
1
2
3
4
5
1
2
3
4
5
2-54
What is a heap
A heap is a binary tree
storing keys at its
internal nodes and
satisfying the following
properties:
– Heap-Order: for every
internal node v other
than the root,
key(v)  key(parent(v))
– Complete Binary Tree: let
h be the height of the
heap
for i = 0, … , h  1, there
are 2i nodes of depth i
at depth h  1, the
internal nodes are to the
left of the external
nodes
The last node of a
heap is the
rightmost internal
node of depth h  1
2
5
9
6
7
last node
2-55
Height of a Heap
Theorem: A heap storing n keys has height O(log n)
Proof: (we apply the complete binary tree property)
– Let h be the height of a heap storing n keys
– Since there are 2i keys at depth i = 0, … , h  2 and at least
one key at depth h  1, we have n  1 + 2 + 4 + … + 2h2 + 1
– Thus, n  2h1 , i.e., h  log n + 1
depth keys
0
1
1
2
h2
2h2
h1
1
2-56
Heaps and Priority Queues
We can use a heap to implement a priority queue
We store a (key, element) item at each internal
node
We keep track of the position of the last node
For simplicity, we show only the keys in the pictures
(2, Sue)
(5, Pat)
(9, Jeff)
(6, Mark)
(7, Anna)
2-57
Insertion into a Heap
Method insertItem of
the priority queue ADT
corresponds to the
insertion of a key k to
the heap
The insertion algorithm
consists of three steps
– Find the insertion node z
(the new last node)
– Store k at z and expand z
into an internal node
– Restore the heap-order
property (discussed
next)
2
5
9
6
z
7
insertion node
2
5
9
6
7
z
1
2-58
Upheap
After the insertion of a new key k, the heap-order
property may be violated
Algorithm upheap restores the heap-order property by
swapping k along an upward path from the insertion node
Upheap terminates when the key k reaches the root or a
node whose parent has a key smaller than or equal to k
Since a heap has height O(log n), upheap runs in O(log n)
time
2
1
5
9
1
7
z
6
5
9
2
7
z
6
2-59
Removal from a Heap
Method removeMin of
the priority queue ADT
corresponds to the
removal of the root
key from the heap
The removal algorithm
consists of three steps
– Replace the root key
with the key of the last
node w
– Compress w and its
children into a leaf
– Restore the heap-order
property (discussed
next)
2
5
9
6
7
w
last node
7
5
w
6
9
2-60
Downheap
After replacing the root key with the key k of the last node,
the heap-order property may be violated
Algorithm downheap restores the heap-order property by
swapping key k along a downward path from the root
Upheap terminates when key k reaches a leaf or a node
whose children have keys greater than or equal to k
Since a heap has height O(log n), downheap runs in O(log n)
time
5
7
5
9
w
7
6
w
6
9
2-61
Updating the Last Node
The insertion node can be found by traversing a path of
O(log n) nodes
– Go up until a left child or the root is reached
– If a left child is reached, go to the right child
– Go down left until a leaf is reached
Similar algorithm for updating the last node after a
removal
2-62
Heap-Sort
Consider a priority
queue with n items
implemented by
means of a heap
– the space used is O(n)
– methods insertItem
and removeMin take
O(log n) time
– methods size,
isEmpty, minKey, and
minElement take time
O(1) time
 Using a heap-based
priority queue, we can
sort a sequence of n
elements in O(n log n)
time
 The resulting algorithm
is called heap-sort
 Heap-sort is much
faster than quadratic
sorting algorithms,
such as insertion-sort
and selection-sort
2-63
Vector-based Heap Implementation
We can represent a heap with n
keys by means of a vector of
length n + 1
For the node at rank i
2
– the left child is at rank 2i
– the right child is at rank 2i + 1
Links between nodes are not
explicitly stored
The leaves are not represented
The cell of at rank 0 is not used
Operation insertItem
corresponds to inserting at
rank n + 1
Operation removeMin
corresponds to removing at
rank n
Yields in-place heap-sort
5
6
9
0
7
2
5
6
9
7
1
2
3
4
5
2-64
Merging Two Heaps
We are given two
heaps and a key k
We create a new heap
with the root node
storing k and with the
two heaps as subtrees
We perform downheap
to restore the heaporder property
3
8
2
5
4
6
7
3
8
2
5
4
6
2
3
8
4
5
7
6
2-65
Bottom-up Heap Construction
We can construct a
heap storing n given
keys in using a
bottom-up
construction with log
n phases
In phase i, pairs of
heaps with 2i 1 keys
are merged into
heaps with 2i+11 keys
2i 1
2i 1
2i+11
2-66
Example
16
15
4
25
16
12
6
5
15
4
7
23
11
12
6
20
27
7
23
20
2-67
Example (contd.)
25
16
5
15
4
15
16
11
12
6
4
25
5
27
9
23
6
12
11
20
23
9
27
20
2-68
Example (contd.)
7
8
15
16
4
25
5
6
12
11
23
9
4
5
25
20
6
15
16
27
7
8
12
11
23
9
27
20
2-69
Example (end)
10
4
6
15
16
5
25
7
8
12
11
23
9
27
20
4
5
6
15
16
7
25
10
8
12
11
23
9
27
20
2-70
Analysis
We visualize the worst-case time of a downheap with a
proxy path that goes first right and then repeatedly goes
left until the bottom of the heap (this path may differ
from the actual downheap path)
Since each node is traversed by at most two proxy paths,
the total number of nodes of the proxy paths is O(n)
Thus, bottom-up heap construction runs in O(n) time
Bottom-up heap construction is faster than n successive
insertions and speeds up the first phase of heap-sort
2-71
Hash Functions and Hash Tables
A hash function h maps keys of a given type to
integers in a fixed interval [0, N  1]
– Example: h(x) = x mod N is a hash function for integer keys
– The integer h(x) is called the hash value of key x
A hash table for a given key type consists of
– A hash function h
– An array (called table) of size N
Example

025-612-0001
981-101-0002

451-229-0004
…
– We design a hash table for a
dictionary storing items (SSN,
Name), where SSN (social
security number) is a ninedigit positive integer
– Our hash table uses an array
of size N = 10,000 and the hash
function
h(x) = last four digits of x
0
1
2
3
4
9997
9998
9999

200-751-9998

2-72
Hash Functions
A hash function is
usually specified as
the composition of
two functions:
Hash code map:
h1: keys  integers
Compression map:
h2: integers  [0, N  1]
The hash code
map is applied
first, and the
compression map
is applied next on
the result, i.e.,
h(x) = h2(h1(x))
The goal of the
hash function is to
“disperse” the keys
in an apparently
random way
2-73
Hash Code Maps
Memory address:
– We reinterpret the memory
address of the key object as
an integer (default hash
code of all Java objects)
– Good in general, except for
numeric and string keys
Integer cast:
– We reinterpret the bits of
the key as an integer
– Suitable for keys of length
less than or equal to the
number of bits of the
integer type (e.g., byte,
short, int and float in Java)
Component sum:
– We partition the bits of
the key into
components of fixed
length (e.g., 16 or 32
bits) and we sum the
components (ignoring
overflows)
– Suitable for numeric
keys of fixed length
greater than or equal
to the number of bits
of the integer type
(e.g., long and double
in Java)
2-74
Hash Code Maps (cont.)
Polynomial accumulation:
– We partition the bits of the
key into a sequence of
components of fixed length
(e.g., 8, 16 or 32 bits)
a0 a1 … an1
– We evaluate the polynomial
p(z) = a0 + a1 z + a2 z2 + …
… + an1zn1
at a fixed value z, ignoring
overflows
– Especially suitable for strings
(e.g., the choice z = 33 gives
at most 6 collisions on a set
of 50,000 English words)
Polynomial p(z) can
be evaluated in O(n)
time using Horner’s
rule:
– The following
polynomials are
successively
computed, each from
the previous one in
O(1) time
p0(z) = an1
pi (z) = ani1 + zpi1(z)
(i = 1, 2, …, n 1)
We have p(z) = pn1(z)
2-75
Compression Maps
Division:
– h2 (y) = y mod N
– The size N of the
hash table is
usually chosen to
be a prime
– The reason has to
do with number
theory and is
beyond the scope
of this course
Multiply, Add and
Divide (MAD):
– h2 (y) = (ay + b) mod N
– a and b are
nonnegative
integers such that
a mod N  0
– Otherwise, every
integer would map
to the same value b
2-76
Collision Handling
Collisions occur
when different
elements are
mapped to the
same cell
Chaining: let each
cell in the table
point to a linked list
of elements that
map there
0
1
2
3
4

025-612-0001


451-229-0004
981-101-0004
Chaining is simple,
but requires
additional memory
outside the table
2-77
Linear Probing
Open addressing: the
colliding item is placed in
a different cell of the
table
Linear probing handles
collisions by placing the
colliding item in the next
(circularly) available
table cell
Each table cell inspected
is referred to as a
“probe”
Colliding items lump
together, causing future
collisions to cause a
longer sequence of
probes
Example:
– h(x) = x mod 13
– Insert keys 18,
41, 22, 44, 59,
32, 31, 73, in this
order
0 1 2 3 4 5 6 7 8 9 10 11 12
41
18 44 59 32 22 31 73
0 1 2 3 4 5 6 7 8 9 10 11 12
2-78
Search with Linear Probing
Consider a hash
table A that uses
linear probing
findElement(k)
– We start at cell h(k)
– We probe consecutive
locations until one of
the following occurs
An item with key k is
found, or
An empty cell is
found, or
N cells have been
unsuccessfully
probed
Algorithm findElement(k)
i  h(k)
p0
repeat
c  A[i]
if c = 
return NO_SUCH_KEY
else if c.key () = k
return c.element()
else
i  (i + 1) mod N
pp+1
until p = N
return NO_SUCH_KEY
2-79
Updates with Linear Probing
To handle insertions and
deletions, we introduce a
special object, called
AVAILABLE, which
replaces deleted elements
removeElement(k)
– We search for an item
with key k
– If such an item (k, o) is
found, we replace it with
the special item
AVAILABLE and we return
element o
– Else, we return
NO_SUCH_KEY
insert Item(k, o)
– We throw an
exception if the table
is full
– We start at cell h(k)
– We probe consecutive
cells until one of the
following occurs
A cell i is found that
is either empty or
stores AVAILABLE,
or
N cells have been
unsuccessfully
probed
– We store item (k, o) in
cell i
2-80
Double Hashing
Double hashing uses a
secondary hash function d(k)
and handles collisions by
placing an item in the first
available cell of the series (i +
jd(k)) mod N
for j = 0, 1, … , N  1
The secondary hash function
d(k) cannot have zero values
The table size N must be a
prime to allow probing of all
the cells
Example
–
–
–
–
N = 13
h(k) = k mod 13
d(k) = 7  k mod 7
Insert keys 18, 41, 22,
44, 59, 32, 31, 73, in
this order
Common choice of
compression map for the
secondary hash function:
d2(k) = q  k mod q where
q < N and q is a prime
The possible values for d2(k)
are 1, 2, … , q
k
18
41
22
44
59
32
31
73
h (k ) d (k ) Probes
5
2
9
5
7
6
5
8
3
1
6
5
4
3
4
4
5
2
9
5
7
6
5
8
10
9
0
0 1 2 3 4 5 6 7 8 9 10 11 12
31
41
18 32 59 73 22 44
0 1 2 3 4 5 6 7 8 9 10 11 12
2-81
Performance of Hashing
In the worst case, searches,
insertions and removals on a
hash table take O(n) time
The worst case occurs when
all the keys inserted into the
dictionary collide
The load factor a = n/N affects
the performance of a hash
table
Assuming that the hash
values are like random
numbers, it can be shown
that the expected number of
probes for an insertion with
open addressing is
1 / (1  a)
The expected
running time of all
the dictionary ADT
operations in a hash
table is O(1)
In practice, hashing
is very fast provided
the load factor is not
close to 100%
Applications of hash
tables:
– small databases
– compilers
– browser caches
2-82
Universal Hashing
A family of hash functions is universal if, for any
0<i,j<M-1,
Pr(h(j)=h(k)) < 1/N.
Choose p as a prime between M and 2M.
Randomly select 0<a<p and 0<b<p, and define
h(k)=(ak+b mod p) mod N
Theorem: The set of all functions, h,
as defined here, is universal.
2-83
Proof of Universality (Part 1)
Let f(k) = ak+b mod p
So a(j-k) is a multiple
of p
Let g(k) = k mod N
But both are less than p
So h(k) = g(f(k)).
So a(j-k) = 0. I.e., j=k.
f causes no collisions:
(contradiction)
– Let f(k) = f(j).
Thus, f causes no
– Suppose k<j. Then
collisions.
 aj + b 
 ak + b 
aj + b  
p
=
ak
+
b

p



 p 
 p 
  aj + b   ak + b  
p
a( j  k ) =  




p
p
 


2-84
Proof of Universality (Part 2)
If f causes no collisions, only g can make h cause
collisions.
Fix a number x. Of the p integers y=f(k), different
from x, the number such that g(y)=g(x) is at most
p / N  1
Since there are p choices for x, the number of h’s
that will cause a collision between j and k is at
most p  p / N  1  p( p  1)


N
There are p(p-1) functions h. So probability of
collision is at most p( p  1) / N 1
p( p  1)
=
N
Therefore, the set of possible h functions is
universal.
2-85