Phone number

[wassabi]

Hello I am writing a program that will search a list of names and numbers
in a separate text file
ie
bob smith 555-1234
I am currently stuck on entering the number (nnn-nnnn)
in order to find the name of the person
so far i have

int first;
char hyphen;
int last;
cin >> first >> hyphen >> last;

I need some way to connect the first and last name without mangling
the numbers involved
any help or suggestions are greatly appreciated i am sure this is
an easy fix but i have already spent way too much time trying to figure this
out

[Return 0]

wassabi wrote:

I need some way to connect the first and last name without mangling
the numbers involved

Not quite sure what you mean about mangling the numbers involved. Let's just assume the file is in the following format:

FirstName LastName PhoneNumber
FirstName LastName PhoneNumber
.
.
.

Here are some questions you need to answer:
1. How do you want the file layout to look once the data is output?
2. Why do you really need to store the hyphen? I don't see the need considering you will never request the first 3 digits of the phone number or the last 4 digits seperately. I might see value in breaking off the area code, but that doesn't seem to be in your requirements.

[wassabi]

The code I have written so far searches a text file that has this information

Able 555-1234
Baker 555-1111
Charles 555-2222
Downs 555-3333
Ebert 555-4444
Fox 555-5555
Green 555-4321
zzz 000-0000

The searching by name half of the program works like a charm
The searching by number half of the program does not work because
of the hyphen. Because I am getting the correct phone number without
the hyphen and it still does not produce the correct results. I have tried breaking
off the area code to no avail and many other solutions. I feel like if I can get past this
small part of inputting the correct phone number to search for in the outfile
that i can complete the rest of the program. Any help is much appreciated.

#include <iostream>
   using std::cin;
   using std::cout;
   using std::endl;
   using namespace std;
   using std::ostream;
   using std::istream;
#include <fstream>
   using std::ofstream;
   using std::fstream;
   using std::ios;
   using std::ifstream;
#include <iomanip>
   using std::setiosflags;
   using std::resetiosflags;
   using std::setw;
   using std::setprecision;
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>


void read  (istream& infile, char name[], int& number);
void write (ostream& outfile, const char name[], int number);
int linearSearch (const char searchName[], const char names[][20], int numberOfListings);
int binarySearch (const char searchName[], const char names[][20], int numberOfListings);
int  read  (const char filename[], char names[][20], int numbers[]);
void write (const char filename[], const char description[],const char names[][20], const int numbers[], int numberOfListings);
int linearSearch (int searchNumber, const int numbers[], int numberOfListings);

int main()
{
char names   [100][20];
int  numbers[100];

   
int numberOfListings = read ("sp13Input.txt", names, numbers);
write ("con:", "Telephone Listings", names, numbers, numberOfListings);


char searchName [20];
   cout << "Enter name for searching: ";
   cin >> searchName;
 
   int location = linearSearch (searchName, names, numberOfListings);
   cout << "linear search results for " << searchName << endl;
   if (location >= 0)
   {
      cout << "array location [" << location << "] contains ";
      write (cout, names[location], numbers[location]);
      cout << endl;
   }  // end if
   else // location < 0
      cout << "name not found by linear search\n";


 location = binarySearch (searchName, names, numberOfListings);
   cout << "binary search results for " << searchName << endl;
   if (location >= 0)
   {
      cout << "array location [" << location << "] contains ";
      write (cout, names[location], numbers[location]);
      cout << endl;
   }  // end if
   else // location < 0
      cout << "name not found by binary search\n";
      
     
    cout << "Enter number for searching (nnn-nnnn): ";
     
int searchNumber;


   // read & convert to a single integer "searchNumber"
   location = linearSearch (searchNumber, numbers, numberOfListings);
   int first;
   int last;
   char hyphen;
   cin >> first >> hyphen >> last;
   searchNumber=first*10000+last;

  
  
   cout << "linear search results for " << searchNumber << endl;
 
   if (location >= 0)
   {
      cout << "array location [" << location << "] contains ";
      write (cout, names[location], numbers[location]);
      cout << endl;
   }  // end if
   else // location < 0
      cout << "number not found by linear search\n";
      
    return 0;
}

int read (const char filename[], char names[][20], int numbers[])
{
  ifstream infile (filename);
  if (!filename)
  {
     cout << "The file could not be found" << "\n";
     exit(1);
  }  // end if
 int numberOfListings = 0; // set numberOfListings to 0
  read (infile, names[numberOfListings], numbers[numberOfListings]);
// see below
  while (strcmp (names[numberOfListings],"zzz" ))// names[numberOfListings] !=  "zzz"
  {
     numberOfListings++;
     read (infile, names[numberOfListings], numbers[numberOfListings]);
  }  // end while
  infile.close ();
  return numberOfListings;
}  // end function read

void read (istream& infile, char name[], int& number)
{
  infile >> name;
  int digits3;
  int digits4;
  char hyphen;
  infile  >> digits3 >> hyphen >> digits4;
  number = digits3*10000 + digits4;// combine 1st 3 digits (digits3) & last 4 (digits4) as one integer
  return;
}  // end function read

void write (const char filename[], const char description[],const char names[][20], const int numbers[], int numberOfListings)
{
  ofstream outfile (filename, ios::out);
  outfile << description << endl;
  for (int i=0; i<numberOfListings-1;i++) // i = 0 to numberOfListings-1
  {
     write (outfile, names[i], numbers[i]); // one entry; see below
     outfile << endl;
  }  // end for
  outfile << endl;
  outfile.close ();
  return;
}  // end function write

void write (ostream& outfile, const char name[], int number)
{
   int prefix = number/10000;// 1st 3 digits of "number"
   int suffix = number%10000;// last 4 digits of "number"
   outfile << setiosflags (ios::left) << setw(21) << name << resetiosflags (ios::left)
           << prefix << '-' << suffix;
   return;
}  // end function write

int linearSearch (const char searchName[], const char names[][20], int numberOfListings)
{
  int location = 0;// set location to 0, the first name to examine
  bool moreToSearch = true;
  while (moreToSearch)
  {
     if (strcmp (searchName,names[location]) > 0) // searchName > names[location]
        location++;
     else if (strcmp (searchName,names[location]) == 0) // searchName == names[location]
        moreToSearch = false;
     else // searchName < names[location]
     {
        moreToSearch = false;
        location = -1;
     }  // end else
  }  // end while
  return location;
}  // end function linearSearch

int binarySearch (const char searchName[], const char names[][20], int numberOfListings)
{
  int mid;
  int left = 0;
  int right = numberOfListings - 1;
  bool found = false;
  while(!found && (left <= right)) // not found and name might still be in list
  {
     mid = (left+ right) / 2;// center between left & right
     if (strcmp (searchName,names[mid]) < 0) // searchName < names[mid]
        right = mid - 1;
     else if (strcmp (searchName,names[mid]) > 0)// searchName > names[mid]
        left = mid + 1;
     else // searchName == names[mid]
        found = true;
  }  // end while
  return (found) ? mid  : -1; // "mid" if found, else -1 (use ? : operator)
}  // end function binarySearch


int linearSearch (int searchNumber, const int numbers[], int numberOfListings)
{
// set location to 0, the first name to examine
bool moreToSearch = true;
int location=0;
while (moreToSearch)
{
if(searchNumber>numbers[location])
location++;
else if(searchNumber==numbers[location])
moreToSearch = false;
else 
{
moreToSearch = false;
location = -1;
} // end else
} // end while
return location;
} // end function linearSearch