/* qsort example */
#include <stdio.h>
#include <stdlib.h>

typedef struct tableEntry tableType;

struct tableEntry {
  int num;
  char *wrd;
};

tableType *table;
int tableSize;

void readTable()
{
int i,j,k;
char buffer[81];

scanf("%d",&tableSize);
table=(tableType*) malloc(tableSize*sizeof(tableType));
if (!table)
{
  printf("malloc fail\n");
  exit(0);
}
for (i=0;i<tableSize;i++)
{
  scanf("%d %s",&(table[i].num),buffer);
  k=strlen(buffer);
  table[i].wrd=malloc(k+1);
  if (!(table[i].wrd))
  {
    printf("malloc fail\n");
    exit(0);
  }
  for (j=0;j<=k;j++)
    table[i].wrd[j]=buffer[j];
}
}

void printTable()
{
int i;

for (i=0;i<tableSize;i++)
  printf("%8d %s\n",table[i].num,table[i].wrd);
}

int numCompare(x,y)
tableType *x,*y;
{
return x->num - y->num;
}

void sortByNumber()
{
qsort((void*) table,tableSize,sizeof(tableType),numCompare);
}

int strCompare(x,y)
tableType *x,*y;
{
return strcmp(x->wrd,y->wrd);
}

void sortByWord()
{
qsort((void*) table,tableSize,sizeof(tableType),strCompare);
}

int revStrCompare(x,y)
tableType *x,*y;
{
return strcmp(y->wrd,x->wrd);
}

void reverseSortByWord()
{
qsort((void*) table,tableSize,sizeof(tableType),revStrCompare);
}

main()
{
readTable();
printf("Input:\n");
printTable();
sortByNumber();
printf("Sorted by number:\n");
printTable();
sortByWord();
printf("Sorted by word:\n");
printTable();
reverseSortByWord();
printf("Reverse sorted by word:\n");
printTable();
}