Insertion sort

Input: A sequence of n numbers {a3 , a1, a2,...,an } Output: A reordered sequence of the input {a1 , a2, a3,...,an } such that a1a2 a3 an

Insertion Sort
Sorted array/list is by inserting one item at a time Simple to implement Efficient on small data sets Efficient on already almost ordered data sets

Insertion Sort
Start with a sequence of size 1 Repeatedly insert remaining elements

Insertion sort pseudo code.

The insertion algorithm

This algorithm takes as parameter an array of the sequence numbers to be sorted A[1 n], the number of elements in the array is denoted by length[ A]. When this algorithm finish, the input array will contains the sorted sequence numbers (sort in place: the sorted items (output) occupy the same storage as the original ones (input) ).

Insertion Sort
void InsertionSort(double a[],int n){ for (int j = 2; j <= n; j++){ double key = a[j]; int i; for (i = j - 1; i > 0 && a[j] >key ; i--){ a[ i + 1] = a[ i]; } a[ i + 1] = key; } }

The insertion sort

We will use A={5, 2, 4, 6, 1, 3} as an input instance. The index j indicate the element to be inserted. A[1j-1] contains the sorted elements. A[j+1n] contains the elements still to be sorted.

Efficiency of Insertion Sort

1. Best time efficiency is (n) 2. Worst time efficiency is O(n2) 3. If array is closer to sorted order
- Less work the insertion sort does - More efficient the sort is

4. Insertion sort is acceptable for small array sizes

7