sortMinTempl

#include <iostream>

template <typename T> void printArr(T arr, int arrSize)
{
    for (int i{ 0 }; i < arrSize; i++) { std::cout << arr[i] << " "; } std::cout << '\n';
}

template <typename T> void sortArr(T arr[], int arrSize)
{
    printArr(arr, arrSize);
    for (int insertPos{ 1 }; insertPos < arrSize; ++insertPos)
    {
        for (int testInsert{insertPos}; testInsert > 0 && arr[testInsert] < arr[testInsert - 1]; --testInsert)
        {
            T tmp{ arr[testInsert - 1] };
            arr[testInsert - 1] = arr[testInsert];
            arr[testInsert] = tmp;

            printArr(arr, arrSize);
        }
    }
    printArr(arr, arrSize);
}

int main()
{
    const int arrSize{ 10 };
    int arr[arrSize] { 6,1,4,2,8,9,11,3,2,1 };
    //int arr[arrSize] = { 1,1,1,2,2,9,11,1,2,1 };
    //int arr[arrSize] = { 1,2,3,4,5,6,7,8,9,10 };
    //int arr[arrSize] = {0};

    sortArr(arr, arrSize);
}