Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages:

How Insertion Sorting Works (http://www.studytonight.com/data-structures/insertion-sorting) |

### Java Source Code:

### Output:

Before Sorted: 15 12 1 9 25 7 14 12 10

After Sorted: 1 7 9 10 12 12 14 15 25