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




using namespace std;

const int MAX_LENGTH=100;

struct rectype
{
	string last;
	string first;
	char middle;
	string tel;
	string room;
	string month;
	string day;
	string year;

};

typedef rectype ItemType; //type of each component


class SortedList
{
public:
	SortedList();
	bool IsEmpty() const;
	bool IsFull() const;
	int LengthIs() const;
	void Insert(ItemType item);
	void Delete(ItemType item);
	bool IsPresent(ItemType item) const;
	void Print() const;
private:
	int length;
	ItemType data[MAX_LENGTH];
	void BinSearchbyName(ItemType item, bool& found, int& position) const;
	void BinSearchMonth(ItemType item, bool& found, int& position) const;
};

SortedList::SortedList()
{
	length=0;
}
bool SortedList::IsEmpty() const
{
	return(length==0);
}
bool SortedList::IsFull() const
{
	return(length==MAX_LENGTH);
}
/*void SortedList::MakeEmpty()
{
	length=0;
}*/
int SortedList::LengthIs() const
{
	return length;
}
void SortedList::Insert(ItemType item)
{
	
	
}

void SortedList::BinSearchbyName(ItemType item, bool& found, int& position) const
{
	int first=0;
	int last=length-1;
	int middle;
	found=false;
	while(last>=first&&!found)
	{
		middle=first+last/2;
		if(item<data[middle])
			last=middle-1;
		else if(item>data[middle])
			first=middle+1;
		else
			found=true;
	}
	if(found)
		position=middle;
}

void SortedList::Delete(ItemType item)
{
	bool found;
	int position;
	int index;
	BinSearchbyName(item,found,position);
	if(found)
	{
		for(index=position; index<length-1;index++)
			data[index]=data[index+1];
		length--;
		
	}

	
}
bool SortedList::IsPresent(ItemType item) const
{
	bool found;
	int position;
	BinSearchbyName(item,found,position);
	return found;	

}
void SortedList::Print() const
{
	

}


void main()
{
	ifstream inF;
	ofstream outF;
	SortedList	list;		//sorted list variable
	rectype info;			//rectype variable

	inF.open("a:/dir1.txt");
	if(!inF)
	{
		cout<<"Error! File not Found";
	}
	outF.open("a:/phonebook.txt");
	if(!outF)
	{
		cout<<"Error! File not Created";
	}

	

	int choice=0;
	while(choice!=999)
	{
        cout<<"Menu"<<endl;
        cout<<"1. Find the entry corresponding to a given last name"<<endl;
        cout<<"2. Display all the telephone directory information"<<endl;
		cout<<"3. Add a new entry to the directory"<<endl;
		cout<<"4. Delete an entry from the directory"<<endl;
		cout<<"5. Display all the persons name whose birthdays is in a               given month"<<endl;
		cout<<"6. Quit"<<endl;
		cout<<"Your selection is-->(1/2/3/4/5/6) "<<endl;
		cin>>choice;

	}
   
}

struct rectype
{
	string last;
	string first;
	char middle;
	string tel;
	string room;
	string month;
	string day;
	string year;

};

int reccmp(ItemType record1, ItemType record2)
{
  //Program will compare the records
  //Return 0 if records are identical
  //Return 1 if record1 is greater than record2
  //Return -1 if record1 is less than record2
  //Currently written to compare by last name, first name and then middle initial

  if(record1.last > record2.last)
    return 1;
  if(record1.last < record2.last)
    return -1;
  //If the program got to here, then the last names are equal, start comparing first names.
  if(record1.first > record2.first)
    return 1;
  if(record1.first < record2.first)    
    return -1;
  //If the program got to here then the first names are equal, start comparing initials
  if(record1.middle > record2.middle)
    return 1;
  if(record1.middle < record2.middle)
    return -1;
  //If the program gets to here, the names are 100% identical!
  return 0;
}