sortMin

#include "pch.h"
#include <iostream>

using namespace std;
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};
    int minEl = arr[0];
    int minIdx = -1;

    for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; } cout << endl;

    for (int head = 0; head < arrSize; head++)
    {
        minEl = arr[head];
        for (int minHead = head; minHead < arrSize; minHead++)
        {
            if (arr[minHead] <= minEl)
            {
                minEl = arr[minHead];
                minIdx = minHead;
            }
        }

        if (arr[head] != minEl)
        {
            arr[minIdx] = arr[head];
            arr[head] = minEl;

            for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; } cout << endl;
        }
    }

    for (int i = 0; i < arrSize; i++) { cout << arr[i] << " "; } cout << endl;
}