Insertion sort works by iterating through an array, inserting each element into its sorted position by shifting other elements over. It finds the location where each element should be inserted into the sorted portion using a linear search, moving larger elements out of the way to make room. This sorting algorithm is most effective for small data sets and can be implemented recursively or iteratively through comparisons and shifts.

3. INSERTION SORT
 while some elements unsorted:
 Using linear search, find the location in the
sorted portion where the 1st element of the
unsorted portion should be inserted
 Move all the elements after the insertion
location up one position to make space for the
new element

5. So,this method is composed of two
phases, namely:

6. public insertionSort(int[] arr)
{
for (int i = 1; i < arr.Length; ++i)
{
int temp = arr[i]; Select
int pos = i;
while (arr[pos-1].CompareTo(temp) > 0 && pos > 0)
{
Comparing
arr[pos] = arr[pos-1];
pos--;
} Shift
arr[pos] = temp;
}
} Insert

8. This method is effective when dealing
with small numbers .
•Mathematical applications : in the search
for greater value, or the smallest value.
•In many other applications.