/* test_heapsort.c */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "heapsort.h"
extern int countcmp, countintr; /* from heapsort.h */

/* sample user program with a data structure and call on  heapsort */

struct elem_type {char key[6]; int  tag;} array[] = {
              "mmmmm",0, "aaaaa",1, "ccccc",2, "ddddd",3, "bbbbb",4,
              "zzzzz",5, "yyyyy",6, "xxxxx",7, "uuuuu",8, "nnnnn",9,
              "ppppp",10,"qqqqq",11,"rrrrr",12,"sssss",13,"ttttt",14,
              "eeeee",15,"fffff",16};
static int num = 16;
static int width = sizeof(struct elem_type);
static double vecd[6] = {3.0, 5.0, 1.0, 6.0, 2.0, 4.0};
static int veci[6] = {4, 5, 1, 6, 2, 3};

static int compare(void *elem1, void *elem2); /* strings */
static int compd(void *elem1, void *elem2);   /* doubles */
static int compint(void *elem1, void *elem2); /* ints */

int main(int argc, char *argv[])
{
  int i, n;


  printf("test_heapsort.c various arrays and statistics \n");
  n = 6;
  printf("before sort of n=%d integers \n",n);
  for(i=0;i<n;i++) printf(" %d \n", veci[i]);
  heapsort((void *)veci, n, sizeof(int), compint);
  printf("after sort of n=%d integers \n",n);
  for(i=0;i<n;i++) printf(" %d \n", veci[i]);

  n = 6;
  printf("before sort of n=%d doubles \n",n);
  for(i=0;i<n;i++) printf(" %f \n", vecd[i]);
  heapsort((void *)vecd, n, sizeof(double), compd);
  printf("after sort of n=%d doubles \n",n);
  for(i=0;i<n;i++) printf(" %f \n", vecd[i]);

  n = num;
  printf("\nbefore sort of n=%d structs \n",n);
  for(i=0;i<n;i++) printf(" %s %d \n",array[i].key,array[i].tag);
  countcmp = 0;
  countintr = 0;
  heapsort( (void *)array, n, width, compare );

  /* statistical data left in heapsort.h */
  printf("after sort count compare=%d, count interchange=%d \n",
         countcmp, countintr);
  printf("n=%d, n*(n-1)=%d, n*log2(n)=64 \n", n, n*(n-1));
  for(i=0;i<num;i++) printf(" %s %d \n",array[i].key,array[i].tag);
  printf("end test_heapsort.c \n");
  return 0;
} /* end test_heapsort main */

/* user provided comparison function 
 * return 1 if key of element_1 follows key of element_2 
 * return 0 if keys are the same ( not used )
 * return -1 if key to element_1 preceeds key of element_2
 */

int compare(void *elem1, void *elem2)
{
  return memcmp(elem1, elem2, 5); /* 5 characters */
}

int compint(void *elem1, void *elem2)
{
  if(*(int *)elem1 < *(int *)elem2) return -1;
  return 1;
}

int compd(void *elem1, void *elem2)
{
  if(*(double *)elem1 < *(double *)elem2) return -1;
  return 1;
}

/* end heapsort.c */