//lin_search

/* An array contains numbers - positive and negative as well,
but we don't know for sure, if there is any negative at all or not
a.) if there is any negative nr., which is the first, at which position
and what is it's value?*/


#include <iostream>
#include <cmath>


using namespace std;

void read(int  data[], int &, int);

bool linker(int  data[], int, int&, int&);

struct lker{
    bool l;
    int ind, value;
};
lker lin_search(int  data[], int);


int main()
{
   const int max_v=30;
   int h[max_v];
   int n;

   read(h, n, max_v);

      //with structure:

        lker result=lin_search(h, n);
        if(result.l)
        {
          cout<<" I found such a nr. and it is at pos.: "<<endl;
          cout<<result.ind<<". ! "<<" and it's value is: "<<result.value<<endl;
        }
        else
        cout<<" I didn't find any!"<<endl;

     // with bool type function

        int ind, val;
        bool there_is=linker(h,n,ind,val);

        if(there_is)
        {
           cout<<" I -the bool func.,- found it as well: "<<ind<<". !"<<" it's value: "<<val<<endl;
         }
        else
	cout<<" I -bool func.,- didn't find as well! "<<endl;

    return 0;
}

void read(int h[], int & n, int max_v)
{
  do
   {
     cout << "How many data, between: (1<=n<= " <<max_v<< ") " << endl;

     cin>>n;
   }while( n<1 || n>max_v);

    cout<<"please, give the values: ";

    for(int i=0; i<n; ++i)
    {

        cin>>h[i];
        cout<<" ";
    }
}


lker lin_search(int  data[], int  n)
{
    lker a;
    a.l=false;
    int i=0;
    while(!a.l && i<n)
   {
        a.l=data[i]<0;
      if(a.l)
        { a.ind=i;
          a.value=data[i];
         }
        i++;
    }

    return a;

}

bool linker(int  data[], int n, int & ind, int & val)
{
    bool l=false;
    int i=0;
    while(!l && i<n)
    {
        l=data[i]<0;
       if(l)
        {
          ind=i;
          val=data[i];
         }
        i++;
     }
    return l;
}