Функции. Заполнение и сортировка массива

#include <iostream>
#include <ctime>

#pragma once

using std::cout;
using std::cin;
using std::endl;

#define TAB "\t"
#define E2 cout "\n\n"
#define E4 cout << "\n\n\n\n"

const int sz = 7;

int insertionSort(bool arr[]);
int insertionSort(int arr[]);
int insertionSort(char arr[]);
int insertionSort(float arr[]);
int insertionSort(double arr[]);
int insertionSort(bool arr[][sz]);
int insertionSort(int arr[][sz]);
int insertionSort(char arr[][sz]);
int insertionSort(float arr[][sz]);
int insertionSort(double arr[][sz]);

void printArray(bool arr[]);
void printArray(int arr[]);
void printArray(char arr[]);
void printArray(float arr[]);
void printArray(double arr[]);
void printArray(bool arr[][sz]);
void printArray(int arr[][sz]);
void printArray(char arr[][sz]);
void printArray(float arr[][sz]);
void printArray(double arr[][sz]);

void fillRandom(bool arr[]);
void fillRandom(int arr[]);
void fillRandom(char arr[]);
void fillRandom(float arr[]);
void fillRandom(double arr[]);
void fillRandom(bool arr[][sz]);
void fillRandom(int arr[][sz]);
void fillRandom(char arr[][sz]);
void fillRandom(float arr[][sz]);
void fillRandom(double arr[][sz]);



#include "Experimental.h"


void main()
{
    srand(time(NULL));

    int alpha[sz];
    int beta[sz][sz];

    fillRandom(alpha);
    fillRandom(beta);

    printArray(alpha);
    E4;
    printArray(beta);
    E4;

    insertionSort(alpha);
    insertionSort(beta);

    printArray(alpha);
    E4;
    printArray(beta);
    E4;
}



#include "Experimental.h"


void fillRandom(bool arr[])
{
    for (int i = 0; i < sz; ++i)
        arr[i] = rand() % 100;
}

void fillRandom(int arr[])
{
    for (int i = 0; i < sz; ++i)
        arr[i] = rand() % 100;
}

void fillRandom(char arr[])
{
    for (int i = 0; i < sz; ++i)
        arr[i] = rand() % 100;
}

void fillRandom(float arr[])
{
    for (int i = 0; i < sz; ++i)
        arr[i] = rand() % 100;
}

void fillRandom(double arr[])
{
    for (int i = 0; i < sz; ++i)
        arr[i] = rand() % 100;
}

void fillRandom(bool arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    for (int j = 0; j < sz; ++j)
        arr[i][j] = rand() % 100;
}

void fillRandom(int arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    for (int j = 0; j < sz; ++j)
        arr[i][j] = rand() % 100;
}

void fillRandom(char arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    for (int j = 0; j < sz; ++j)
        arr[i][j] = rand() % 100;
}

void fillRandom(float arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    for (int j = 0; j < sz; ++j)
        arr[i][j] = rand() % 100;
}

void fillRandom(double arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    for (int j = 0; j < sz; ++j)
        arr[i][j] = rand() % 100;
}



#include "Experimental.h"


int insertionSort(bool arr[])
{
    int tmp;

    for (int i = 1; i < sz; ++i)
    for (int j = i; j > 0; --j)
    {
        if (arr[j] < arr[j - 1])
        {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
        }
    }

    return 0;
}

int insertionSort(int arr[])
{
    int tmp;

    for (int i = 1; i < sz; ++i)
    for (int j = i; j > 0; --j)
    {
        if (arr[j] < arr[j - 1])
        {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
        }
    }

    return 0;
}

int insertionSort(char arr[])
{
    int tmp;

    for (int i = 1; i < sz; ++i)
    for (int j = i; j > 0; --j)
    {
        if (arr[j] < arr[j - 1])
        {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
        }
    }

    return 0;
}

int insertionSort(float arr[])
{
    int tmp;

    for (int i = 1; i < sz; ++i)
    for (int j = i; j > 0; --j)
    {
        if (arr[j] < arr[j - 1])
        {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
        }
    }

    return 0;
}

int insertionSort(double arr[])
{
    int tmp;

    for (int i = 1; i < sz; ++i)
    for (int j = i; j > 0; --j)
    {
        if (arr[j] < arr[j - 1])
        {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
        }
    }

    return 0;
}

int insertionSort(bool arr[][sz])
{
    int tmp;

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[i][k - 1] > arr[i][k]; --k)
    {
        tmp = arr[i][k - 1];
        arr[i][k - 1] = arr[i][k];
        arr[i][k] = tmp;
    }

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[k - 1][i] > arr[k][i]; --k)
    {
        tmp = arr[k - 1][i];
        arr[k - 1][i] = arr[k][i];
        arr[k][i] = tmp;
    }
    return 0;
}

int insertionSort(int arr[][sz])
{
    int tmp;

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[i][k - 1] > arr[i][k]; --k)
    {
        tmp = arr[i][k - 1];
        arr[i][k - 1] = arr[i][k];
        arr[i][k] = tmp;
    }

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[k - 1][i] > arr[k][i]; --k)
    {
        tmp = arr[k - 1][i];
        arr[k - 1][i] = arr[k][i];
        arr[k][i] = tmp;
    }
    return 0;
}

int insertionSort(char arr[][sz])
{
    int tmp;

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[i][k - 1] > arr[i][k]; --k)
    {
        tmp = arr[i][k - 1];
        arr[i][k - 1] = arr[i][k];
        arr[i][k] = tmp;
    }

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[k - 1][i] > arr[k][i]; --k)
    {
        tmp = arr[k - 1][i];
        arr[k - 1][i] = arr[k][i];
        arr[k][i] = tmp;
    }
    return 0;
}

int insertionSort(float arr[][sz])
{
    int tmp;

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[i][k - 1] > arr[i][k]; --k)
    {
        tmp = arr[i][k - 1];
        arr[i][k - 1] = arr[i][k];
        arr[i][k] = tmp;
    }

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[k - 1][i] > arr[k][i]; --k)
    {
        tmp = arr[k - 1][i];
        arr[k - 1][i] = arr[k][i];
        arr[k][i] = tmp;
    }
    return 0;
}

int insertionSort(double arr[][sz])
{
    int tmp;

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[i][k - 1] > arr[i][k]; --k)
    {
        tmp = arr[i][k - 1];
        arr[i][k - 1] = arr[i][k];
        arr[i][k] = tmp;
    }

    for (int i = 0; i < sz; ++i)
    for (int j = 1; j < sz; ++j)
    for (int k = j; k > 0 && arr[k - 1][i] > arr[k][i]; --k)
    {
        tmp = arr[k - 1][i];
        arr[k - 1][i] = arr[k][i];
        arr[k][i] = tmp;
    }
    return 0;
}



#include "Experimental.h"


void printArray(bool arr[])
{
    for (int i = 0; i < sz; ++i)
        cout << arr[i] << TAB;
}

void printArray(int arr[])
{
    for (int i = 0; i < sz; ++i)
        cout << arr[i] << TAB;
}

void printArray(char arr[])
{
    for (int i = 0; i < sz; ++i)
        cout << arr[i] << TAB;
}

void printArray(float arr[])
{
    for (int i = 0; i < sz; ++i)
        cout << arr[i] << TAB;
}

void printArray(double arr[])
{
    for (int i = 0; i < sz; ++i)
        cout << arr[i] << TAB;
}

void printArray(bool arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    {
        for (int j = 0; j < sz; ++j)
            cout << arr[i][j] << TAB;
        cout << endl << endl;
    }
}

void printArray(int arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    {
        for (int j = 0; j < sz; ++j)
            cout << arr[i][j] << TAB;
        cout << endl << endl;
    }
}

void printArray(char arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    {
        for (int j = 0; j < sz; ++j)
            cout << arr[i][j] << TAB;
        cout << endl << endl;
    }
}

void printArray(float arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    {
        for (int j = 0; j < sz; ++j)
            cout << arr[i][j] << TAB;
        cout << endl << endl;
    }
}

void printArray(double arr[][sz])
{
    for (int i = 0; i < sz; ++i)
    {
        for (int j = 0; j < sz; ++j)
            cout << arr[i][j] << TAB;
        cout << endl << endl;
    }
}