# Insertion Sort Algorithm Assignment Help

Insertion sort really requested for sorting small arrays associated with data. Insertion sort algorithm somewhat resembles Selection Sort. Array is imaginary split in to two parts - sorted one as well as unsorted one. At the start, sorted part consists first element of the array and unsorted one consists the rest. At each step, algorithm requires first element within the unsorted part and inserts it to the right place of the sorted one. Whenever unsorted part gets empty, algorithm stops. Insertion sort algorithm step looks like this particular:

Become

An example of sorting an array: Sort 7, -5, 2, 16, 4 using insertion Sort.