Insertion Sort Analysis

Analysis of Algorithm
Lecture # 6
Mariha Asad
 Insertion Sort
for(int i=1; i<=n-1 ; i++)
{
int temp = a[i];
int j = i-1;
while(j>=0 && temp < a[j]) Array is virtually splited into orted or iunsorted
part.
{ Values from unsorted part are picked and place at
a[j+1] = a[j]; correct position in sorted part.
j--;
}
a[j+1] = temp;
}
 Temp = 18
j= 0
A[j] = 35 (18<35)
Insertion Sort i=2
Temp = 73
j=1
35 18 73 40 20 A[j] = 35 (73 < 35) false
i=3
18 35 73 40 20 Temp = 40
j=2
18 35 73 40 20 A[j] = 73 (40< 73) true
18 35 40 73 20 j= 1
A[j] = 35 (40< 35) false
18 20 35 40 73 i=4
Temp = 20
j=3
A[j] = 73 (20< 73) true
J=2
A[j] = 40 (20< 40) true
J=1
A[j] = 35 (20< 35) true
J=0
A[j] = 18 (20< 18) false
 Insertion Sort Analysis for Worst Case
for(int i=1; i<=n-1 ; i++) n
{
int temp = a[i]; n-1
int j = i-1; n-1
while(j>=0 && temp < a[j]) (n(n+1)/2) -1
{
a[j+1] = a[j]; n(n-1)/2
f(n) = n+ n-1 + n-1 + (n(n+1)/2) -1
j--; n(n-1)/2
+ n(n-1)/2 + n(n-1)/2 + n-1
}
a[j+1] = temp; n-1
}
 Helping Slide
for(int i=1; i<=n-1 ; i++) for(int i=1; i<=n-1 ; i++) i stmt header
{ {
int temp = a[i]; for(j=i-1; j>=0 && temp < a[j]; 1 1 2
int j = i-1; j--)
while(j>=0 && temp < a[j]) { 2 2 3
{ stmt;
a[j+1] = a[j]; }
j--; } 3 3 4
}
a[j+1] = temp; (This code is similar to the 4 4 5
} leftside code)
n-1 n-1 n

Sum of natural numbers= (1+2+3+…+n) = n*(n+1)/2

When we sum till n-1 then sum of natural numbers(for stmt) = n-1*(n-1+1)/2
= n*(n-1)/2
n=5; 5*4/2= 10 (for stmt)
(5*6/2)-1 (for header)
 Insertion Sort Analysis for Best Case
for(int i=1; i<=n-1 ; i++) n
{
int temp = a[i]; n-1
int j = i-1; n-1
while(j>=0 && temp < a[j]) n-1
{
a[j+1] = a[j]; 0
f(n) = ?
j--; 0
}
a[j+1] = temp; n-1
}
 Insertion Sort Analysis
How can you use summation for worst case analysis of insertion sort.

Let’s try for it

Thanks