Zad5

#include <stdio.h>

int prost(int n)
{
    if (n == 1) return 0;

    int i;
    for(i = 2; i <= n / 2; i++)
    {
        if (n % i == 0) return 0;
    }

    return 1;
}

int prost_min_max(int* niz, int vel) {
    int i, min = -1, max = -1;
    for (i = 0; i < vel; i++) {
        if (prost(niz[i]) == 1)
        {
            if (niz[i] > max) max = niz[i];
            if (niz[i] < min || min == -1) min = niz[i];
        }
    }

    if (min == -1) return -1;
    return max - min;
}


int main()
{
    int niz[] = {1, 2, 3, 4, 5, 6, 7, 8};
    printf("%d", prost_min_max(niz, 8));

    return 0;
}