#include<iostream.h>
#include<apstring.h>
#include<fstream.h>
#include<apvector.h>
#include<conio.h>
#include<stdlib.h>


void quickSort (apvector<apstring> &list, int first, int last);
void swap(apvector<apstring> &list,int g, int h);
struct info
{
apstring firstname;
apstring lastname;
apstring email;
apstring areacode;
apstring phone;
};


void main()
{ apstring path;
cout<<"what is the path name in which the file is stored..?"<<endl;
cin>>path;

const char *cstring;

	cstring = path.c_str();






apstring helo;
int counter;
int length;
ifstream  infile;
	infile.open (cstring,ios::in);
					if (infile.fail())  cerr<<"did not open corectly"<<endl;

infile>>length;
apvector <apstring> friends(length);
for(int j=0;j<length; j++)

		infile>>friends[j];


	for(int loop=0; loop<length;loop++)
	cout<<friends[loop]<<endl;
	quickSort(friends,0,21);
	cin.get();
	cout<<endl<<endl<<"============A=F=T=E=R==S=O=R=T=I=N=G========"<<endl;
		for(int loop123=0; loop123<length;loop123++)
	cout<<friends[loop123]<<endl;
	cout<<endl<<endl<<"============A=F=T=E=R==S=O=R=T=I=N=G========"<<endl;

	int choice;
	cout<<"what would you like todo??"<<endl;
	cout<<"1.serch for a last name";
	cout<<"2.serch for a first name";
	cout<<"3.serch for a phone number";
	cout<<"4.serch for a area code";
	cout<<"5.serch for a E-mail adress";
	cin>>choice;
	switch (choice)
	{
	case 1:
	cout<<"what is the last name of the person who you are looking for?";
	cin>>lastname;
   LNserch(lastname,<apvector--0f wutever the names..gtg lunch>)./.




}

void quickSort (apvector<apstring> &list, int first, int last)
{


int g = first, h = last;					// Set index values 'g' and 'h' to 'first' and 'last'
	int midIndex;								// Create a middle index value
	apstring dividingValue;							// Create a comparison value
	midIndex = (first + last) / 2;				// Set the midIndex value to the middle index of the array portion
	dividingValue = list[midIndex];				// Set the comparison value equal to the middle of the array


	do
	{
		while (list[g] < dividingValue) g++;
		while (list[h] > dividingValue) h--;
		if (g <= h)
		{
			swap(list,g,h);
			g++;
			h--;
		}
	}
	while (g < h);
	if (h > first) quickSort (list,first,h);
	if (g < last) quickSort (list,g,last);
}


void swap(apvector<apstring> &list,int g, int h)
{

	apvector <apstring>temp(2);
	temp[1]=list[g];
	list[g]=list[h];
	list[h]=temp[1];
}