/*

Courtney Molvig
Section 2
Lab 11
April 10, 2018
*/

#include <iostream>
#include <fstream>
#include <string>

using namespace std;

//--------------- Global Variables ---------------

const int maxArraySize = 2000;

//--------------- Function Prototype ---------------

int NameSearch (string[], int maxArraySize, string SearchedName);
void LengthNames(string[], int maxArraySize);

//--------------- Main ---------------

int main()
{
string BabyNames[maxArraySize];

ifstream infile;
infile.open("namedata.txt");

for (int ArraySpot = 0; ArraySpot < maxArraySize; ArraySpot++)

{
infile >> BabyNames[ArraySpot];
}

/* for (int ArraySpot = 0; ArraySpot < maxArraySize; ArraySpot++)

{
cout << ArraySpot + 1 << ") " << BabyNames[ArraySpot] <<
endl;
}
*/

//NameSearch(BabyNames,maxArraySize,SearchedName);

cout << NameSearch(BabyNames, maxArraySize, "Jackie") << endl;

LengthNames(BabyNames, maxArraySize);
}

//--------------- Name Search Function ---------------

int NameSearch(string BabyNames[], int maxArraySize, string SearchedName)
{
 for (int CheckNames = 0; CheckNames < maxArraySize; CheckNames++)
{
if (BabyNames[CheckNames] == SearchedName)
{
return CheckNames;
}
}

return -1;
}

//-------------- Lengths of Names Function ---------------

void LengthNames(string BabyNames[], int maxArraySize)
{
int MIN = 0;
int MAX= 11;

for(int curr_length = MIN; curr_length <= MAX; curr_length++)

{
int total = 0 ;
cout << "Names of length" << curr_length << ": ";
for (int index = 0; index < maxArraySize; index++)
{
if (BabyNames[index].length() == curr_length)
{
total +=1;
}
}
cout << total << " names." << endl;
}
}