keep getting access violation reading location error.

[Winslowz11d7d]

Hey guys I am having trouble with this project. It is suppose to read names from a list, sort them, and find a name when searched while displaying the name, number on the list, and time it took to find it. I keep getting error message that shows "Exception thrown at 0x535F4950 (vcruntime140d.dll) in lab 8 v1.exe: 0xC0000005: Access violation reading location 0x02240365. If there is a handler for this exception, the program may be safely continued." I have tried looking around on this forum as well as other forums but still cant find the answer to this problem. Please advise.

Name.cpp
  #include "stdafx.h"
#include "names.h"

FemaleNames::FemaleNames()
{
	this->rank = 0;
	this->name = "";
}
//accessor methods of class FemaleNames
int FemaleNames::getRank()
{
	return this->rank;
}
string FemaleNames::getName()
{
	return this->name;
}
//mutator methods of class FemaleNames
void FemaleNames::setRank(int rank)
{
	this->rank = rank;
}
void FemaleNames::setName(string name)
{
	this->name = name;
}


Name.h
#ifndef names_H
#define names_H
#include<iostream>
#include<string>

using namespace std;
class FemaleNames
{
private:
	int rank;
	string name;

public:
	FemaleNames();
	int getRank();
	string getName();
	void setRank(int rank);
	void setName(string name);

};
#endif


Main.cpp
#include "stdafx.h"
#include "names.h"
#include<iostream>
#include <fstream>
#include <string>
#include <time.h>
#include<ctime>

using namespace std;

void sortNames(FemaleNames *fnames, int count);
int linearSearch(FemaleNames *fnames, string searchKey, int count);
int binarySearch(FemaleNames *fnames, string searchKey, int count);
string toUpper(string name);

int main()
{
	FemaleNames fn[1000];
	string name;
	int value;
	int count = 0;
	string searchKey;
	ifstream infile("CommonFemaleNames.txt");
	if (infile)
	{
		infile >> value;
		infile >> name;
		fn[count].setName(name);
		fn[count].setRank(value);
		while (!infile.eof())
		{
			count++;
			infile >> value;
			infile >> name;
			fn[count].setName(name);
			fn[count].setRank(value);
		}
	}
	infile.close();
	sortNames(fn, count);
	for (int i = 0; i <= count; i++)
		cout << fn[i].getName() << "\t" << fn[i].getRank() << endl;
	clock_t startClock, finishClock;
	double timeCount;
	cout << "Enter search key: " << endl;
	cin >> searchKey;
	searchKey = toUpper(searchKey);
	cout << searchKey << endl;
	startClock = clock() / 1000;
	int pos1 = linearSearch(fn, searchKey, count);
	finishClock = clock() / 1000;
	timeCount = finishClock - startClock;
	if (pos1 != -1)
		cout << "The key is found at: " << pos1 << endl;
	else
		cout << "Element not found" << endl;
	cout << "The time taken to find the key using linear search is: " << timeCount << " ns." << endl;
	startClock = clock() / 1000;
	int pos2 = binarySearch(fn, searchKey, count);
	finishClock = clock() / 1000;
	timeCount = finishClock - startClock;
	if (pos2 != -1)
		cout << "The key is found at: " << pos2 << endl;
	else
		cout << "Element not found" << endl;
	cout << "The time taken to find the key using binary search is: " << timeCount << " ns." << endl;
	system("pause");
	return 0;
}
string toUpper(string name)
{
	for (int i = 0; i<name.size(); i++)
	{
		name[i] = toupper(name[i]);
	}
	return name;
}
void sortNames(FemaleNames *fnames, int count)
{
	FemaleNames temp;
	for (int i = 0; i<count; i++)
	{
		for (int j = i + 1; j <= count; j++)
		{
			if (fnames[i].getName().compare(fnames[j].getName())>0)
			{
				temp = fnames[i];
				fnames[i] = fnames[j];
				fnames[j] = temp;
			}
		}
	}
}
int linearSearch(FemaleNames *fnames, string searchKey, int count)
{
	for (int i = 0; i <= count; ++i)
	{
		if (fnames[i].getName().compare(searchKey) == 0)
			return i;
	}
	return -1;
}
int binarySearch(FemaleNames *fnames, string searchKey, int count)
{
	int first = 0, last = count + 1, middle, position = -1;
	bool found = false;
	while (!found && first < last)
	{
		middle = (first + last) / 2;
		if ((fnames[middle].getName().compare(searchKey)) == 0)
		{
			return middle;
		}
		else if ((fnames[middle].getName().compare(searchKey)) > 0)
			last = middle - 1;
		else
			first = middle + 1;
	}
	return -1;
}

[MistahMoose]

edit : Your error states youre reading invalid locations
Could be pointers pointing to the wrong place or array accessing out of bounds. I didnt look too close

You declare FemaleNames fn as an array of 1000 but dont have a limit on where your loop stops when filling that array, except that it stops at the end of the file.
Is your file larger than 1000 loops? (or looping more than you anticipated)

remember that checking eof is finicky. It only sets the flag after attempting to read the location past where the file ends.

[Thomas1965]

When you declare an array with 1000 elements valid indexes are 0 - 999. So have a look at lines 95 and 150

[Winslowz11d7d]

Yes thanks. I just needed to increase the array size to get rid of the access violation. Now to prefect my program because both my time and ranking of the name still shows 0 aswell as adding a stop command. thanks MistahMoose

[Thomas1965]

First I would check if the data is read correctly from the file by printing your array on the console.