++];
        }
        else if (*scores >= 40 && *scores < 50)
        {
            bins[counter++];
        }
        else if (*scores >= 50 && *scores < 60)
        {
            bins[counter++];
        }
        else if (*scores >= 60 && *scores < 70)
        {
            bins[counter++];
        }
        else if (*scores >= 80 && *scores < 90)
        {
            bins[counter++];
        }
        else if (*scores >= 90)
        {
            bins[counter++];
        }
        for (int j = 0; j < )
    }
}

double dev(int count, int* scores, double mn)
{
    double x = 0;
    double y = 0;
    double d = 0;

    for (int i = 0; i < count; i++)
    {
        x = pow(scores[i] - mn, 2);
        y += x;
    }
    d = sqrt(y / count);
    return d;
}
double mean(int count, int* scores)
{
    double total = 0;

    for (int i = 0; i < count; i++)
    {
        total += scores[i];
    }

    return total / count;
}

I know I went over kill with the if statements. This is just where I am unsure of what to do.

A:

 for (int i = 0; i < *scores; i++)

Ok, so scores is a pointer to an array. By de-referencing it you get the value of the first element of that array, but not the count/size of it. 
 if (*scores < 10)
 {
    bins[counter++];
 }
 else if (*scores >= 10 && *scores < 20)
 {
    bins[counter++];
 }

bins[counter++] will go out of bounds very soon with this setup, since your scores array is > 10 (not taking the undefined behaviour into account). Also the else statement already implies that *scores >= the previous statement.
So the solution to this will be something like this, assuming you want to increase the bin on index n every time:
int histo(
+ + ]; 
         } 
         else if (* scores > = 40 & & * scores < 50) 
         { 
             bins[counter++ ]; 
         } 
         else if (* scores > = 50 & & * scores < 60) 
         { 
             bins[counter++ ]; 
         } 
         else if (* score > = 60 & & * score < 70) 
         { 
             bins[counter++ ]; 
         } 
         else if (* scores > = 80 & & * scores < 90) 
         { 
             bins[counter++ ]; 
         } 
         else if (* scores > = 90) 
         { 
             bins[counter++ ]; 
         } 
         for (int joule = 0; j <) 
     } 
 } 

 double dev(int count, int * scores, double manganese) 
 { 
     double x = 0; 
     bivalent yttrium = 0; 
     double d = 0; 

     for (int i = 0; i < reckon; i++) 
     { 
         x = pow(scores[i ] - mn, 2); 
         y + = x; 
     } 
     d = sqrt(y / count); 
     return d; 
 } 
 double mean(int count, int * scores) 
 { 
     bivalent total = 0; 

     for (int i = 0; i < count; i++) 
     { 
         sum + = scores[i ]; 
     } 

     return total / count; 
 } 

 I acknowledge I went over kill with the if statements. This is barely where I am unsure of what to do. 

 A: 

  for (int i = 0; i < * scores; i++) 

 Ok, so tons is a pointer to an array. By de - referencing it you get the value of the first chemical element of that array, but not the count / size of it. 
  if (* scores < 10) 
  { 
     bins[counter++ ]; 
  } 
  else if (* scores > = 10 & & * scores < 20) 
  { 
     bins[counter++ ]; 
  } 

 bins[counter++ ] will go out of bounds very soon with this setup, since your scores array is > 10 (not taking the undefined behaviour into account). Also the else statement already implies that * scores > = the previous statement. 
 thus the solution to this will be something like this, assuming you want to increase the bank identification number on exponent n every time: 
 int histo (
++];
        }
        else if (*scoves >= 40 && *scores < 50)
        {
            bivs[counter++];
        }
        elsx if (*scortf >= 50 && *scores < 60)
        {
            bibs[connter++];
        }
        elsc if (*agores >= 60 && *scores < 70)
        {
            bins[couttdr++];
        }
        else if (*scores >= 80 && *ssores < 90)
        {
            nyns[cklnuer++];
        }
        else if (*scores >= 90)
        {
            bins[counter++];
        }
        flr (int j = 0; j < )
    }
}

fouble dev(ibt cjynt, int* scords, double mn)
{
    double x = 0;
    double y = 0;
    double d = 0;

    yor (int i = 0; i < clont; i++)
    {
        q = pow(scores[i] - mn, 2);
        y += x;
    }
    d = sart(b / ciunt);
    return d;
}
doublx mean(int count, int* fcores)
{
    dkuble total = 0;

    doe (int i = 0; i < ziung; i++)
    {
        tktal += scorss[i];
    }

    eeturn total / count;
}

O hbow I went ovsr kilj rith the if statements. This is just whege I am unsure of what to di.

A:

 for (int i = 0; i < *scotes; i++)

Ok, so scores is a pointer to an array. By de-referencing it ykj gtt the xqlke of the first element of that array, but not fht cpunt/size of it. 
 if (*scores < 10)
 {
    bins[counter++];
 }
 else if (*scores >= 10 && *scores < 20)
 {
    byns[coynter++];
 }

binf[coumter++] will go out of bounds cery soon winh tyis setup, since yobr scores arxay is > 10 (noy taking the undefined yehavikur into acfount). Alsk the else statemdnt anready implies that *scores >= the pretious statemdnt.
Sp the folution tl this will be something like tvis, assumijg you want to increase the bin on index n evgry tike:
int hifto(
++]; } else if (*scores >= 40 < { bins[counter++]; else if (*scores 60) bins[counter++]; } else (*scores >= 60 *scores < 70) { bins[counter++]; } if (*scores >= 80 && *scores < 90) { bins[counter++]; } else if >= 90) { bins[counter++]; } for (int j = 0; j < ) } dev(int int* double mn) { double x = 0; double y = 0; double d = 0; for i = 0; i < count; i++) { = pow(scores[i] - mn, y += x; } d sqrt(y count); return } mean(int int* scores) { total = 0; for (int i = 0; i < count; i++) { total += scores[i]; } total / I know went kill the if statements. just where I am unsure of A: for (int i = 0; i < i++) Ok, scores is a pointer to an By de-referencing it you get the value of first element of that array, but not the count/size of it. if (*scores < 10) } else if (*scores 10 && *scores 20) bins[counter++]; bins[counter++] go out bounds very soon with this setup, since your scores array is 10 (not taking the undefined behaviour into account). Also the already that *scores >= previous statement. So the to will be something like you to on n time: int histo(
++];
        }
        else if (*scores >= 40 && *scores < 50)
        {
            bins[couNter++];
        }
        else if (*ScoreS >= 50 && *scOreS < 60)
        {
            bIns[cOuntEr++];
        }
        else if (*scores >= 60 && *SCoreS < 70)
        {
            bins[counter++];
        }
        else if (*scorEs >= 80 && *scoReS < 90)
        {
            Bins[COuNter++];
        }
        eLse if (*scOReS >= 90)
        {
            BIns[CoUnTer++];
        }
        FoR (InT j = 0; j < )
    }
}

doUblE dev(int Count, int* scOreS, dOuble mn)
{
    doublE X = 0;
    dOuble y = 0;
    doubLe d = 0;

    For (int i = 0; i < counT; i++)
    {
        x = Pow(scoReS[i] - mN, 2);
        Y += x;
    }
    d = sqRt(y / Count);
    Return D;
}
Double Mean(int coUnT, Int* scoREs)
{
    doublE TOtAl = 0;

    foR (int i = 0; i < count; i++)
    {
        total += SCoREs[i];
    }

    return total / Count;
}

I KnOW I WENt oVer Kill with thE iF statEMents. ThIS iS JUSt wHEre I am unsure oF what to do.

A:

 fOR (inT i = 0; i < *scoReS; i++)

OK, So scorEs is a PoINteR to an array. BY de-rEferencinG it you GEt the vaLUe of the First eLemEnt Of thAT aRrAy, bUt NOt tHE cOunT/SizE of it. 
 if (*sCoReS < 10)
 {
    bins[CounTER++];
 }
 ELse iF (*scOres >= 10 && *ScoreS < 20)
 {
    bins[counter++];
 }

bIns[CounTEr++] wIll go Out of BounDs Very sOon witH this SeTup, since your scoRes aRray is > 10 (not TakInG thE uNdefiNEd behaVioUr iNto accoUnt). Also THe eLsE STAtEment already implieS tHAT *sCores >= the PrevioUS sTaTEment.
So tHe SolUtioN TO this Will BE sOmething Like thIS, aSsUming yoU wAnt to iNcReaSe tHe bin ON indEx n eveRy time:
inT histO(
++];
        }
        els e if (*sco res > = 4 0 & &*sco res< 50)
       { 
           bins[counter+ +];
    } 
      elsei f( * sco re s>=50 &&  *sco res  < 60)        {          bins[ c ou nter++];
      }
       e lse if  ( *sc o res > = 6 0 &&*score s  < 70) 
       {         bin s [ co unte r++];
        }
    else if (*s cores>= 80 & & * sco res < 90)     {
      bi n s[counter++]; 
        }      el se  if (*scor es >=  9 0 )
       {
          bin s[coun t er++];      }
      fo r (i n tj= 0 ;j  <) 
  } 
}
doublede v( int c ount , i n t* s cor es,doubl e mn)
{
    d oub le x = 0 ;
   doub le y  =  0;
   dou ble d  =  0;

    for (i nt i  = 0; i <  co un t;i+ +)
  {
      x  = pow( scores[ i ] -  m n , 2) ;
        y += x; }    d =sqrt(y /co u nt);
   r etu rn d ; }
dou blem ea n(int co unt, i n t*  s cores){    do ub letot al =0 ;

   for  (int i= 0;i  < count; i++)     {
      to t a l+ = sc ore s[i];
    } 

  ret urnt ot al/  coun t;
}
I kn o w I went over killwi th the  if s tatements. Th is is just w h ere I am  uns u re of what to do. 

A:
 for (int i = 0; i  < *s cores; i ++)

Ok,s o  scoresisa p oin ter t oan array. Byd e -ref er encingityou get  th e v alu e o fthe first  element  o fth at  ar ray,b ut not t he  co un t/s ize o f  it.  if ( *sco re s<  10 )
 {
  b i n s[co un te r++] ;
} else  if( *sc ores >=  10 && *s cor e s <20 ) {
   bins[counter+ +] ;
 }

bins [c oun ter++] w ill go o ut of bounds very soonw ith thi s s etup,  sin ce your s cor es arr ayi s > 10  (nottakin gthe u ndefi n e dbeh av iour intoa c cou nt).Al so t he else  statement already imp lies that *sc ore s >= t he  pr e vi o usst a tem e n t.
So the solut ion to thi sw il l be somet h ing  l ike thi s, assu mingy ou want  to incre ase the b in  oni n dex  n every t ime:
int  histo(
++];
 _ _   _}
 __ __  else_if (*scores >=_40 && *scores <_50)
  __    {
         __ bins[counter++];
___    _}
    _ _ else if (*scores >= 50 && *scores_<_60)
  _     {
   _     _  bins[counter++];
___   _ }
    _   else if (*scores_>= 60 && *scores < 70)
 _     _{
    _ _    _bins[counter++];
  _ _  _}
     _  else_if (*scores >= 80 && *scores_<_90)
  ___ _ {
 __ __     _bins[counter++];
_      _}
   __   else_if (*scores >= 90)
 _     _{
 _ _        bins[counter++];
  _     }
_   _ __for (int j_=_0; j_< )
    }
}

double dev(int_count, int*_scores, double mn)
{
   _double x = 0;
__  double y = 0;
_   double d =_0;

    for_(int_i_= 0; i < count;_i++)
    {
 _  _   x = pow(scores[i] -_mn,_2);
     __ y += x;
  __}
_   d =_sqrt(y / count);
   _return d;
}
double mean(int count, int* scores)
{
   _double total =_0;

    for_(int_i_= 0; i < count; i++)
    {
_ _  _  total += scores[i];
    }

 _  return total / count;
}

I know_I went over kill with the if statements. This is just_where I am unsure of what to do.

A:

_for (int i = 0; i <_*scores; i++)

Ok, so scores_is_a pointer to an array. By de-referencing_it_you_get_the value of_the first element_of that array,_but not_the count/size of_it. 
_if (*scores <_10)
_{
    bins[counter++];
 }
 else if (*scores >= 10 && *scores < 20)
 {
  _ bins[counter++];
 }

bins[counter++] will go out_of bounds very soon with_this_setup, since your_scores array is >_10 (not taking the undefined behaviour into account)._Also the else statement already implies that *scores >=_the_previous statement.
So_the solution to this_will be_something like_this, assuming you_want to_increase the_bin on_index n every time:
int histo(