Insertion Sort

Approach: We divide the array into 2 parts sorted and unsorted We take one element from unsorted part and insert in its correct position in sorted part

void insertionSort(int arr[], int n)
{
    int i, key, j;
    
    for (i = 1; i < n; i++)
    {
        key = arr[i];
        j = i - 1;
 
        /* Move elements of arr[0..i-1], that are
        greater than key, to one position ahead
        of their current position */
        while (j >= 0 && arr[j] > key)
        {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}

Time Complexity: O(n ^ 2)