A problem with final program.

[DontSeeMinusMinus]

#include <iostream>
using namespace std;

int function(int*, int);
int function2(int*, int); 

int  main ()

{

    int* a; 
    int* b; 
    int n; 
    int ok; 

    do
    {

    cout << "How much natural numbers? >>> ";
    cin >> n;
    cout <<endl;

    a=new int[n];

    for(int i=0;i<n; i++)
    {
        cout<< "Number " << i+1 << " >>> ";
        cin>>a[i];
    } 

    b=new int[n];

    for(int j=0;j<n;j++)
    {
        b[j]=function(a,n);
    }

    cout << function2(b,n);

    delete [] a;
    delete [] b;

    cout <<"Continue (1) End (0)?"<<endl;
    cin>>ok;
    }while(ok==0);

    return 0;
}

    int function(int* a, int n)
{
    for(int j=0;j<n;j++)

    for (int i=2;i<a[j];i++)

    (a[j]%i==0);
  
}


    int function2(int* b, int n) 
{
    for(int i=0;i<n;i++)

    if(b[i] == 0)
        cout<<"One of the number is 0 !"; 
    else
       cout<<"Max divisor "<< (b[i+1], b[i]%b[i+1])<<endl;
}

Struggled with this program for ore than 12 hours straight finally, it seems, at least to me, it's starting to somewhat work.

So the program goes like this ->
cin >> n // length of first array
cin >> a[i] // I enter all numbers
First function reads the first array and returns a[i] numbers which are not primes.
New array b with the newly found results from the previous function.
Second function reads the second array and prints out max divisor of 2 numbers.

cin >>4
cin >> a[i] (6986)
function one returns 6 9 6
cin >> b[i] (696)
function2 returns 3 as the maximum number.

The problem is, it returns only 0 for me and the message that one of the numbers is 0.

I'd grately appreciate any kind of a help!
Thanks in advance!

[toum]

Your function function() does not return anything.
Besides, you can't return an array. You'll have to pass b to function() and copy into it the elements of a[] which are not primes.