min_max_find

#include <iostream>

using namespace std;

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

/*   https://pastebin.com/hhtbF8wv  */

int gen_rand(int a, int b) {
    return rand() % (b + 1 - a) + a;
}

void gen_randarr(int size, int arr[], int a, int b) {
    for (int k = 0; k < size; k++) {
        arr[k] = gen_rand(a, b);
    }
}

int get_max(int size, int arr[]) {
    int max = arr[0];
    for (int k = 1; k < size; k++) {
        if (max < arr[k]) {
            max = arr[k];
        }
    }
    return max;
}

int get_maxid(int size, int arr[]) {
    int max = arr[0];
    int maxid = 0;
    for (int k = 1; k < size; k++) {
        if (max < arr[k]) {
            max = arr[k];
            maxid = k;
        }
    }
    return maxid;
}

int get_minid(int size, int arr[]) {
    int min = arr[0];
    int minid = 0;
    for (int k = 1; k < size; k++) {
        if (min > arr[k]) {
            min = arr[k];
            minid = k;
        }
    }
    return minid;
}

int find_val(int size, int arr[], int val) {
    //int idval = -1;
    for (int k = 0; k < size; k++) {
        if (arr[k] == val) {
            //idval = k;
            return k;  // return idval;
        }
    }
    return -1; // return idval;
}


void show_minmax(int size, int arr[]) {
    int max = arr[0];
    int min = arr[0];
    int idmax = 0;
    int idmin = 0;

    for (int k = 1; k < size; k++) {
        if (max < arr[k]) {
            max = arr[k];
            idmax = k;
        }

        if (min > arr[k]) {
            min = arr[k];
            idmin = k;
        }
    }

    cout << "max in " << idmax+1 << " equal " << max << endl;
    cout << "min in " << idmin+1 << " equal " << min << endl;
}

int get_min(int size, int arr[]) {
    int min = arr[0];
    for (int k = 1; k < size; k++) {
        if (min > arr[k]) {
            min = arr[k];
        }
    }
    return min;
}

void task0() {
    int arr[20];
    gen_randarr(20, arr, 0, 100);
    int razmer;
    cout << "Enter size: ";
    cin >> razmer;
    show_arr(razmer, arr);
    cout << "max: " << get_max(20, arr) << endl;

    cout << "44: " << find_val(20, arr, 44) << endl;
    cout << "50: " << find_val(20, arr, 50) << endl;
    cout << "97: " << find_val(20, arr, 97) << endl;
    cout << "23: " << find_val(20, arr, 23) << endl;

    cout << endl;

    for (int k = 20; k <= 40; k++) {
        int pos = find_val(20, arr, k);
        if (pos >= 0) {
            cout << k << ": " << pos << endl;
        }
    }

    show_minmax(20, arr);
}

void task1() {
    const int N = 5;
    int a[N]{ 1,2,3,4,5 };
    int b[N]{ 5,4,3,2,1 };
    int c[2 * N];



    c[0] = a[0];
    c[1] = b[0];
    c[2] = a[1];
    c[3] = b[1];
    c[4] = a[2];
    c[5] = b[2];
    c[6] = a[3];
    c[7] = b[3];
    c[8] = a[4];
    c[9] = b[4];

    show_arr(2 * N, c);
}

int main() {
    cout << "Hello" << endl;

    srand(time(NULL));

    task1();
    return 0;
}