array

#include <iostream>
#include <fstream>
using namespace std;

void input_array(float a[], int n)
{
    for (int i = 0; i<n; i++)
        cin >> a[i];
}
void output_array(float a[], int n)
{
    for (int i = 0; i<n; i++)
        cout << a[i] << " ";
}
bool is_even(int i)
{
    if (i % 2 == 0)
        return 1;
    else return 0;
}
void add_random_elem_in_array(float a[], int n)
{
    for (int i = 0; i<n; i++)
        a[i] = ((float)(-100 + rand() % 201)/10);
}
float sum_elem_of_array(float a[], int n)
{
    float c = 0;
    for (int i = 0; i<n; i++)
        c += a[i];
    return c;
}
float multiplication_of_numbers(float a[], int n)
{
    float c = 1;
    for (int i = 0; i<n; i++)
        c *= a[i];
    return c;
}
int Max_el_of_array(float a[], int n)
{
    int max = 0;
    for (int i = 0; i<n; i++)
        if (a[i]>a[max]) max = i;
    return max;
}
int Min_el_of_array(float a[], int n)
{
    int min = 0;
    for (int i = 0; i<n; i++)
        if (a[i]<a[min]) min = i;
    return min;
}

void sort_section_array(float a[], int n)
{
    int j = 0;
    float tmp = 0;
    for (int i = 0; i<n; i++)
    {
        j = i;
        for (int k = i; k<n; k++)
        {
            if (a[j]>a[k])
            {
                j = k;
            }
        }
        tmp = a[i];
        a[i] = a[j];
        a[j] = tmp;
    }

}
void sort_bubble_array(float a[], int n)
{
    float tmp = 0;
    for (int i = 0; i<n; i++) {
        for (int j = n - 1; j >= i + 1; j--) {
            if (a[i]<a[j - 1]) {
                tmp = a[j];
                a[j] = a[j - 1];
                a[j - 1] = tmp;
            }
        }
    }
}
void sort_insertion_array(float a[], int n)
{
    float key = 0;
    int i = 0;
    for (int j = 1; j<n; j++) {
        key = a[j];
        i = j - 1;
        while (i >= 0 && a[i]>key) {
            a[i + 1] = a[i];
            i = i - 1;
            a[i + 1] = key;
        }
    }
}
bool search(float v, float a[], int n)
{
    if (n <= 0)
        return false;
    int m = n / 2;
    if (v == a[m - 1])
        return true;
    else if (v>a[m - 1])
        search(v, a, m - 1);
    else return false;
}



void include_in_array(float a[], int n, float b, int idx)
{
    float arr[1000], *c;
    int i, j;
    for (i = 0; i<idx; i++) {
        arr[i] = a[i];
    }
    arr[idx] = b;
    for (i = idx, j = ++idx; i<n, j<(n + 1); i++, j++) {
        arr[j] = a[i];
    }
    c = arr;

}

bool is_negative(float i)
{
    if (i < 0)
        return 1;
    else return 0;
}
int first_negativ_el(float a[], int n)
{
    int j = 0;

    for (int i = 0; i<n; i++)
        if (is_negative(a[i]))
        {
            j = i;
            break;
        }
    return j;
}
int second_negativ_el(float a[], int n)
{
    int j = 0;

    for (int i = n; i >= 0; i--)
    {
        if (is_negative(i))
            j = i;
        break;
    }
    return j + 1;
}
float sum_between_negative_el(float a[], int n, int first, int second)
{
    float c = 0;
    for (int i = first; i<second; i++)
        c += a[i];
    return c;
}

void sjat(float a[], int n)
{
    float arr[100];
    int last = n-1;
    int j = 0;
    for (int i = 0; i<n; i++)
        if (abs(a[i])>1)
        {
            arr[j] = a[i];
            j++;
        }
        else
        {
            arr[last] = 0;
            last--;
        }
    output_array(arr, n);


}
float sum_of_even_digit(float a[], int n)
{
    float c = 0;
    for (int i = 1; i<n; i++)
        if(!is_even(i))
        c += a[i];
    return c;
}

int main()
{
    int n = 5;
    float a[10];
    cout << "\n array \n";
    add_random_elem_in_array(a, n);
    output_array(a, n);
    cout << "\n summa nechetnih \n";
    cout << sum_of_even_digit(a, n);
    cout << "\n summa interval \n";
    cout << sum_between_negative_el(a, n,
                                    first_negativ_el(a, n),
                                    second_negativ_el(a, n));

    cout << "\n sjat massiv \n";
    sjat(a, n);

    return 0;
}