/***************************************
 ** Implementation for functions on the
 ** the struct Member
 ***************************************/
#include "Member.h"

void read(Member &M, istream &IN)
{
  IN >> M.first >> M.last;
}

void write(Member M, ostream &OUT)
{
  OUT << M.first << ' ' << M.last;
}

bool comp(Member a, Member b)
{
  return (a.last == b.last && a.first < b.first) || a.last < b.last;
}

void selectionsort(Member *A, int N)
{
  for(int length = N; length > 1; length--)
  {
    // Find imax, the index of the largest
    int imax = 0, i;
    for(i = 1; i < length; i++)
      if (comp(A[imax],A[i]))
	imax = i;
    // Swap A[imax] & the last element
    Member temp = A[imax];
    A[imax] = A[length - 1];
    A[length - 1] = temp;
  }
}