Sorting Algorithms


Insertion Sort

Department: IT Course: IT 317 Lecturer: Savriddin Khalilov

 Definition

 Insertion Sort sorts a set by finding the next available
unsorted element and inserting it into the sorted
region of the set.
 In every iteration before inserting the unsorted to it
is ordered place other elements of the array will be
shifted to the end of the set.

Department: IT Course: IT 317 Lecturer: Savriddin Khalilov

 Flow Chart


Department: IT Course: IT 317 Lecturer: Savriddin Khalilov

 Pseudo & Program Codes

Algorithm: insertionSort()
void insertionSort(int arr[])
Input: Set A with n integers.
{
Output: Sorted set A.
int j;
int temp;
for i ← 1 to n do for(int i=1; i<n; i++)
temp ← A[i] {
for j ← i-1 down to j>=0 AND temp=arr[i];
A[j]>temp for(j=i-1;(j>=0)&&(arr[j]>temp);j--)
do A[j+1] ← A[j] {
A[j+1] ← temp arr[j+1]=arr[j];
}
arr[j+1]=temp;
}
}

Department: IT Course: IT 317 Lecturer: Savriddin Khalilov

 Usage

 Insertion sort is used when number of elements is
small. It can also be useful when input array is
almost sorted, only few elements are misplaced in
complete big array.

Department: IT Course: IT 317 Lecturer: Savriddin Khalilov

 big-O notation

 Time Complexity: O(n*n)
 Auxiliary Space: O(1)
 Boundary Cases: Insertion sort takes maximum time to
sort if elements are sorted in reverse order. And it takes
minimum time (Order of n) when elements are already
sorted.
 Algorithmic Paradigm: Incremental Approach
 Sorting In Place: Yes
 Stable: Yes
 Online: Yes
Department: IT Course: IT 317 Lecturer: Savriddin Khalilov