struct if1
{
  string idnum;//id number for the student
  string lastname;//last name of student
  string firstname;//first name of student
  int examscore[maxexam];//array of all the exam scores of the student
  int hwscore[maxhw];//array of all the home work scores of the student
 
  void operator=(if1& f1)
  {
      idnum = f1.idnum;
      lastname = f1.lastname;
      firstname = f1.firstname;
      memcpy(examscore, f1.examscore, sizeof(examscore));
      memcpy(hwscore,f1.hwscore,sizeof(hwscore));
  }
};
 
...
...
<snip>
...
 
void alphasort(if1 student[], int n)
//the alphasort function will sort the records into alphabetical order by last name. It expects the list as well as the total number of 
//names and will return the sorted array. The basic format for this function came from the class handout on bubblesorting.
{
    if1 temp;//used as a swapping mechanism
    int i; int j;// used for implementing for loop checks
    int f=1;//used for checking letters after the first
    for (i=0; i < n-1; i++)
    {
        for (j=0; j < n-(i+1); j++)
        {
            if(student[j].lastname[0] > student[j+1].lastname[0])
            {
                temp = student[j];
                student[j] = student[j+1];
                student[j+1] = temp;
            }
        }
    }
}

void alphasort(if1 student[], int n)
//the alphasort function will sort the records into alphabetical order by last name. It expects the list as well as the total number of 
//names and will return the sorted array. The basic format for this function came from the class handout on bubblesorting.
{
    if1 temp;//used as a swapping mechanism
    int i; int j;// used for implementing for loop checks
    int f=1;//used for checking letters after the first
    for (i=0; i < n-1; i++)
    {
        for (j=0; j < n-(i+1); j++)
        {
            string n1 = student[j].lastname;
            string n2 = student[j+1].lastname;
            if(n1 == n2)
            {
                n1 = student[j].firstname;
                n2 = student[j+1].firstname;
            }
            if(n1 > n2)
            {
                temp = student[j];
                student[j] = student[j+1];
                student[j+1] = temp;
            }
        }
    }
}