// Read names and pop
    for (i=0; i < NUMNAMES; i++)
    {
        // input
        in_stream >> popularity >> boyName >> girlName;   
        // store all data in array
        boyNames[i] = boyName;
        girlNames[i] = girlName;   
    }
    in_stream.close();

    // Search for name in arrays
    boyPopularity = -1;
    girlPopularity = -1;
    
    for (i=0; i < NUMNAMES; i++)
    {
        if (boyNames[i] == targetName)
        {
              boyPopularity = i+1;          
        }
        if (girlNames[i] == targetName)
        {
              girlPopularity = i+1;
        }
    }

    // Output results if matched
    cout << targetName << " is ";
    if (boyPopularity > 0)
    {
    cout << "ranked " << boyPopularity << " in popularity among boys.\n";
    }
    
    else
    {
        cout << "not ranked among the top 1000 boy names.\n";
    }
    cout << targetName << " is ";
    if (girlPopularity > 0)
    {
        cout << "ranked " << girlPopularity << " in popularity among girls.\n";
    }
    else
    {
        cout << "not ranked among the top 1000 girl names.\n";
    }
    system("PAUSE");
    return 0;
}

char charArr[] = "Test String";
int i = 0;
for(i=0;i<11;i++){ cout << "char " << i << "is " << charArr[i] << endl; }

// Define the data structure
typedef struct _charStruct {
  char c;
  struct _charStruct *next;
} charStruct;

// populate the data structure
char str[] = "Test String";
int i = 0;
charStruct *firstCharStruct = NULL;
charStruct *ptr = NULL;
charStruct *new = NULL;

for(i=0; i<11;i++){
  new = malloc(sizeof(charStruct));
  new->c = str[i];
  new->next = NULL;
  if(ptr){
    ptr->next = new;
  }
  ptr = new;
  if(!firstCharStruct){ firstCharStruct = new; }
}

// Now that it's populated, loop through it and print each character
for(ptr=firstCharStruct;ptr;ptr=ptr->next){
  cout << "Character: " << ptr->c << endl;
}

// We also need to delete the dynamically allocated memory:
ptr = firstCharStruct;
while(ptr){
  new = ptr; // Might as well re-use the new pointer we declared before
  ptr = ptr->next; //pointer will eventually hit the last member of the list whose "next"
                            // member will be NULL, ending the loop
  free(new);
}

Enter the first name, to see popularity:
Justice

Justice is ranked 406 in popularity among boys.
Justice is ranked 497 in popularity among girls.
Press any key to continue . . .

	bool terminate = false;
	while (!terminate)
	{
		cout << "Please enter a name or type 'done' to finshes searching.\nName: ";
		string target;
		cin  >> target;
		
		tempPtr = topList;

		while ((tempPtr->boysName != target) && (tempPtr->girlsName != target) &&
			(tempPtr->link != NULL))
		{
			tempPtr = tempPtr->link;
		}
		
		if (target == "done")
			terminate = true;
			
		
		else if (tempPtr->boysName == target)
		{
			cout << target << " is ranked " << tempPtr->rank << " among boys' names.\n" << endl;
        }
        
    	else if (tempPtr->girlsName == target)
    	{
             
			cout << target << " is ranked " << tempPtr->rank << " among girls' names.\n" << endl;
        }
		else
			cout << "baby name not found in databaase\n" << endl;
	}