Samrup

Introduction: Analysis of
Algorithms, Insertion Sort,

Merge Sort
Lecture 1
Analysis of algorithms
The theoretical study of computer-program
performance and resource usage.
Whats more important than performance?
modularity
user-friendliness
correctness
programmer time
maintainability
simplicity
functionality
extensibility
robustness
reliability
L1.2
Why study algorithms and

performance?
Algorithms help us to understand scalability.
Performance often draws the line between what
is feasible and what is impossible.
Algorithmic mathematics provides a language
for talking about program behavior.
The lessons of program performance generalize
to other computing resources.
Speed is fun!
L1.3
The problem of sorting

Input: sequence a1, a2, , an of numbers.
Output: permutation a'1, a'2, , a'n such
that a'1 a'2 a'n .
Example:
Input: 8 2 4 9 3 6
Output: 2 3 4 6 8 9
L1.4
Insertion Sort
pseudocode
sorted
INSERTION-SORT (A, n) A[1 . . n]

for j 1 to n
do key A[ j]
ij1
while i > 0 and A[i] > key
do A[i+1] A[i]
ii1
A[i+1] = key
j
key
L1.5
Example of Insertion Sort

8
L1.6

8
L1.7

8
L1.8

8
L1.9

8
L1.10

8
L1.11

8
L1.12

8
L1.13

8
L1.14

8
L1.15

8
9 done
L1.16
Running time
The running time depends on the input: an
already sorted sequence is easier to sort.
Parameterize the running time by the size of
the input, since short sequences are easier to
sort than long ones.
Generally, we seek upper bounds on the
running time, because everybody likes a
guarantee.
L1.17
Kinds of analyses
Worst-case: (usually)
T(n) = maximum time of algorithm
on any input of size n.
Average-case: (sometimes)
T(n) = expected time of algorithm
on any input of size n.
Best-case: (bogus)
Cheat with a slow algorithm that
works fast on some input.
L1.18
Machine-independent time
What is insertion sorts worst-case time?
It depends on the speed of our computer:
relative speed (on the same machine),
absolute speed (on different machines).
BIG IDEA:
Ignore machine-dependent constants.
Look at growth of T(n) as n .
Asymptotic Analysis
L1.19
Q-notation
Math:
Q(g(n)) = { f (n) : there exist positive constants c1, c2, and

n0 such that 0 c1 g(n) f (n) c2 g(n)
for all n n0 }
Engineering:
Drop low-order terms; ignore leading constants.
Example: 3n3 + 90n2 5n + 6046 = Q(n3)
L1.20
Asymptotic performance
When n gets large enough, a Q(n2) algorithm
always beats a Q(n3) algorithm.
T(n)
n0
We shouldnt ignore
asymptotically slower
algorithms, however.
Real-world design
situations often call for a
careful balancing of
engineering objectives.
Asymptotic analysis is a
useful tool to help to
structure our thinking.
L1.21
Insertion sort analysis

Worst case: Input reverse sorted.
T ( n)
Q
(
j
)
Q
n
[arithmetic series]
j 2
Average case: All permutations equally likely.
T ( n)
Q( j / 2) Qn 2
j 2
Is insertion sort a fast sorting algorithm?

Moderately so, for small n.
Not at all, for large n.
L1.22
Merge sort
MERGE-SORT A[1 . . n]
To sort n numbers:
1. If n = 1, done.
2. Recursively sort A[ 1 . . n/2 ] and
A[ n/2+1 . . n ] .
3. Merge the 2 sorted lists.
Key subroutine: MERGE
L1.23
Merging two sorted arrays

20 12
13 11
7
L1.24

20 12
13 11
7
1
1
L1.25

20 12
20 12
13 11
13 11
L1.26

20 12
20 12
13 11
13 11
L1.27

20 12
20 12
20 12
13 11
13 11
13 11
L1.28

20 12
20 12
20 12
13 11
13 11
13 11
L1.29

20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
L1.30

20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
L1.31

20 12
20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
13 11
L1.32

20 12
20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
13 11
11
L1.33

20 12
20 12
20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
13 11
13
11
L1.34

20 12
20 12
20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
13 11
13
11
12
L1.35

20 12
20 12
20 12
20 12
20 12
20 12
13 11
13 11
13 11
13 11
13 11
13
11
12
Time = Q(n) to merge a total

of n elements (linear time).
L1.36
Analyzing merge sort

MERGE-SORT (A, n) A[1 . . n]
To sort n numbers:
T(n)
1. If n = 1, done.
Q(1)
2T(n/2) 2. Recursively sort A[ 1 . . n/2 ]
Abuse
and A[ n/2+1 . . n ] .
Q(n)
3. Merge the 2 sorted lists
Sloppiness: Should be T( n/2 ) + T( n/2 ) ,
but it turns out not to matter asymptotically.
L1.37
Recurrence for merge sort

T(n) =
Q(1) if n = 1;
2T(n/2) + Q(n) if n > 1.
We shall usually omit stating the base

case when T(n) = Q(1) for sufficiently
small n (and when it has no effect on the
solution to the recurrence.
Lecture 2 provide several ways to find a
good upper bound on T(n).
L1.38
Recursion tree
Solve T(n) = 2T(n/2) + cn, where c > 0 is constant.
L1.39
Recursion tree
T(n)
L1.40
Recursion tree
cn
T(n/2)
T(n/2)
L1.41
Recursion tree
cn
cn/2
cn/2
T(n/4)
T(n/4)
T(n/4)
T(n/4)
L1.42
Recursion tree
cn
cn/2
cn/2
cn/4
cn/4
cn/4
cn/4
Q(1)
L1.43
Recursion tree
cn
cn/2
cn/2
h = lg n cn/4
cn/4
cn/4
cn/4
Q(1)
L1.44
Recursion tree
cn
cn
cn/2
cn/2
h = lg n cn/4
cn/4
cn/4
cn/4
Q(1)
L1.45
Recursion tree
cn
cn
cn/2
cn/2
h = lg n cn/4
cn/4
cn/4
cn
cn/4
Q(1)
L1.46
Recursion tree
cn
cn
cn/2
cn/2
cn/4
cn/4
cn/4
cn
h = lg n cn/4
cn
Q(1)
L1.47
Recursion tree
cn
cn
cn/2
cn/2
cn/4
cn/4
cn/4
cn
h = lg n cn/4
cn
Q(1)
#leaves = n
Q(n)
L1.48
Recursion tree
cn
cn
cn/2
cn/2
cn/4
cn/4
cn/4
cn
h = lg n cn/4
cn
Q(1)
#leaves = n
Q(n)
TotalQ(n lg n)
L1.49
Conclusions
Q(n lg n) grows more slowly than Q(n2).
Therefore, merge sort asymptotically
beats insertion sort in the worst case.
In practice, merge sort beats insertion
sort for n > 30 or so.
Go test it out for yourself!
L1.50

Samrup

Uploaded by

Document Information

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

Samrup

Uploaded by

Copyright:

Available Formats

Introduction: Analysis of

Algorithms, Insertion Sort,

Why study algorithms and

The problem of sorting

INSERTION-SORT (A, n) A[1 . . n]

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Example of Insertion Sort

Q(g(n)) = { f (n) : there exist positive constants c1, c2, and

Insertion sort analysis

Average case: All permutations equally likely.

Is insertion sort a fast sorting algorithm?

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Merging two sorted arrays

Time = Q(n) to merge a total

Analyzing merge sort

Recurrence for merge sort

We shall usually omit stating the base

You might also like