new_lesson5

#include <iostream>
#include <ctime>
#include <Windows.h>

using namespace std;

void temperature() {
    srand(time(0));
    const int min_heat = 50;
    const int diap_heat = 20;
    const int size = 10;
    const int num_points = 4;

    int heat[size][num_points];

    for (int n = 0; n < num_points; n++) {
        for (int k = 0; k < size; ++k) {
            heat[k][n] = 5*n +  min_heat + rand() % diap_heat;
        }
    }

    for (int k = 0; k < size; ++k) {
        heat[k][2] = 0;
    }

    for (int k = 0; k < size; ++k) {
        for (int n = 0; n < num_points; n++) {
            cout << heat[k][n] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

void genArr2D(int sz1,
              int arr[][4],
              int min = -10,
              int max = 10) {
    if (min > max)
        swap(min, max);
    for (int n = 0; n < 4; n++)
        for (int k = 0; k < sz1; k++)
            arr[k][n] = min + rand() % (max - min + 1);
}

void showArr2D(int sz1, int arr[][4]) {
    for (int n = 0; n < 4; n++){
        for (int k = 0; k < sz1; k++) {
            cout << arr[k][n] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

void arr_manipulation() {
    //temperature();
    int arr1[10][4];
    genArr2D(10, arr1, 10, 20);
    showArr2D(10, arr1);

    cout << endl;

    int arr2[10][4];
    genArr2D(10, arr2, 50, 60);
    showArr2D(10, arr2);

    cout << endl;
    int arr3[10][4];
    for (int k = 0; k < 10; k++)
        for (int n = 0; n < 4; n++)
            arr3[k][n] = arr2[k][n] + arr1[k][n];
    showArr2D(10, arr3);

    cout << endl;
    int arr4[20][4];
    for (int k = 0; k < 10; k++)
        for (int n = 0; n < 4; n++) {
            arr4[k][n] = arr1[k][n];
            arr4[k + 10][n] = arr2[k][n];
        }
    showArr2D(20, arr4);

    cout << endl;
    int arr5[20][4];
    for (int k = 0; k < 10; k++)
        for (int n = 0; n < 4; n++) {
            arr5[2 * k][n] = arr1[k][n];
            arr5[2 * k + 1][n] = arr2[k][n];
        }
    showArr2D(20, arr5);
}

void showDies(int N) {
    char canv[5][9];
    for (int k = 0; k < 5; k++)
        for (int n = 0; n < 9; n++)
            canv[k][n] = ' ';

    canv[0][0] = '+';
    canv[0][8] = '+';
    canv[4][0] = '+';
    canv[4][8] = '+';

    for (int k = 1; k < 4; k++) {
        canv[k][0] = '|';
        canv[k][8] = '|';
    }

    for (int k = 1; k < 8; k++) {
        canv[0][k] = '-';
        canv[4][k] = '-';
    }

    switch (N)
    {
    case 1:
        canv[2][2*2] = '*';
        break;
    case 2:
        canv[1][1*2] = '*';
        canv[3][3*2] = '*';
        break;
    case 3:
        canv[1][3*2] = '*';
        canv[3][3*2] = '*';
        canv[3][1*2] = '*';
        break;
    case 4:
        canv[1][1*2] = '*';
        canv[3][3*2] = '*';
        canv[3][1*2] = '*';
        canv[1][3*2] = '*';
        break;
    case 5:
        canv[2][2*2] = '*';
        canv[1][1*2] = '*';
        canv[3][3*2] = '*';
        canv[3][1*2] = '*';
        canv[1][3*2] = '*';
        break;
    case 6:
        canv[1][1*2] = '*';
        canv[2][1*2] = '*';
        canv[3][1*2] = '*';
        canv[1][3*2] = '*';
        canv[2][3*2] = '*';
        canv[3][3*2] = '*';
        break;
    default:
        break;
    }

    cout << "\n\n\n";
    for (int k = 0; k < 5; k++) {
        cout << "   ";
        for (int n = 0; n < 9; n++)
            cout << canv[k][n];
        cout << endl;
    }
}

void animation() {
    for (int k = 0; k < 10; k++) {
        cout << "#" << endl;
        Sleep(500);
    }
    cout << endl;
}


void genArr(int sz, int arr[]) {
    for (int k = 0; k < sz; k++)
        arr[k] = rand() % 100;
}

void showArr(int sz, int arr[]) {
    for (int k = 0; k < sz; k++)
        cout << arr[k] << " ";
    cout << endl;
}

template <class T>
void selectSort(long sz, T arr[]) {
    int i, j, k;
    T tmp;
    // перебор по текущим значениям
    for (i = 0; i < sz; i++) {
        k = i;
        tmp = arr[i];
        // поиск минимума
        for (j = i + 1; j < sz; j++) {
            if (arr[j] > tmp) {
                k = j;
                tmp = arr[j];
            }
        }
        // обмен текущего значения с минимальным
        if (k != i) {
            arr[k] = arr[i];
            arr[i] = tmp;
        }
    }
}

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

void main() {
    int arr[10];
    genArr(10, arr);
    showArr(10, arr);
    //selectSort(10, arr);
    bubbleSort(10, arr);
    showArr(10, arr);

    //showDies(6);
}