Question

==============C++ or java================

Write a modularized, menu-driven program to read a file with unknown number of records.

• Create a class Records to store the following data: first and last name, GPA , an Id number, and an email

• Input file has unknown number of records; one record per line in the following order: first and last names, GPA , an Id number, and email

• All fields in the input file are separated by a tab (‘\t’) or a blank space (up to you)

• No error checking of the data required; all records are unique

• Store records in an array of objects

• Create a menu which allows to

• example

• print records unsorted

• sort by any field using array-based selection sort

• sort by any field using array-based insertion sort

• sort by any field using array-based quick sort

• sort by any field using array-based bubble sort

• quit the program and print a table of number of comparisons and the number of items movements for each sort performed

Sort Field Number of Comparisons Number of Items Movements    

quick GPA 25 100

• Before each sort, reload the array from the input function

• After each sort, print the sorted array, number of comparisons, and the number of items movements

• Write one function for each type of sort, that can sort by any field. Do not copy and paste body of sort code five times into the same function. The same body of the code should be able to handle sorting by any field based on the use choice. Start with bubble sort because it is the easiest to modify. To ensure that you write the sort code correctly, submit your bubble sort code here, as a Text Entry, before submitting the entire lab. This way I can let you if you have implemented the sort function correctly.

• A user should be able to run many as many times as user wants

• NO goto, continue, while(true), break (except for switch) or similar. It will result in grade of zero. No additional attempts would be allowed

• Use const ( array size) and enums (menu choices, sort choice) were appropriate

• The length of a file is unknown; make sure your programs handles empty files and files that have more records than an array can fit.

• Follow established best practices and create cohesive functions. For example, a sort function should only sort. It should not ask a user what field to sort by and should not print.

• Clearly label the output

• Well document your code (comments)

• Include your test data and our input file

• Test your program thoroughly; at least 100 records.

Record must be in the following order: Firs Name, Last Name, GPA, ID, email

example: Mary Jones 3.9 887196478 may.jones@pierce.edu

Answer 1

#include
#include
#include

using namespace std;
class Records
{
public:
   string FirstName, LastName, Email, ID;
   double GPA;
   void UnsortedPrint(Records StudentRc[],int x) const;
   void IDsearchRecord(Records StudentRc[],int x) const;
};

void Records::UnsortedPrint(Records StudentRc[],int x) const
{
   cout << "\n\t\tFirstName\tLastName\tGPA\tID\t\tEmail" << endl;
   for (int i = 0; i < x; i++)
   {
       cout << "\t\t" << StudentRc[i].FirstName << "\t" << StudentRc[i].LastName << "\t"
           << StudentRc[i].GPA << "\t" << StudentRc[i].ID << "\t\t" << StudentRc[i].Email << endl;
   }
}

void Records::IDsearchRecord(Records StudentRc[],int x) const
{
   string Num;
   bool found = false;
   cout << "\n\tEnter studnet ID : ";
   cin >> Num;
   for (int i = 0; i < x; i++)
   {
       if (StudentRc[i].ID == Num)
       {
           cout << "\tRecord Number\t\tFirstName\tLastName\tGPA\tID\t\tEmail" << endl;
           cout << "\t\t" << StudentRc[i].FirstName << "\t" << StudentRc[i].LastName << "\t"
               << StudentRc[i].GPA << "\t" << StudentRc[i].ID << "\t\t" << StudentRc[i].Email << endl;
           found = true;
       }
   }
   if (!found)
       cout << "\n\t" << Num << " is not found in the data." << endl;
}
  
int main()
{
   Records Studnet;
   Records StudentRc[100];
   fstream inFile;
   char Option = 'x';
   int x = 0;
   inFile.open("C:\\Users\\JONGMIN\\Desktop\\540 C++\\inFile.txt");

   while (!inFile.eof())
   {
       inFile >> StudentRc[x].FirstName >> StudentRc[x].LastName;
       inFile >> StudentRc[x].GPA >> StudentRc[x].ID >> StudentRc[x].Email;
       ++x;
   }
  
   while (true) //Fixeit
   {
       cout << "\n\tA. Print records that is unsorted " << endl;
       cout << "\tB. Search student records by student ID " << endl;
       cout << "\tC. Quit the program" << endl;
       cout << "\tOption : ";
       cin >> Option;
       switch (Option)
       {
       case 'A':
       case 'a':
           Studnet.UnsortedPrint(StudentRc,x);
           break;
       case 'B':
       case 'b':
           Studnet.IDsearchRecord(StudentRc,x);
           break;
       case 'C':
       case 'c':
           exit(1);
           break;
       default:
           cout << "\nYou entered a wrong option. Please enter the initial in the Menu \n\n";
           break;
       }
   }
   inFile.close();
   system("pause");
   return 0;
}