bucket Sort dalam bahasa C

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

#define MAX 100
#define INPUT 'i'
#define OUTPUT 'o'
#define _MY_DEBUG
#if defined(_MY_DEBUG)
 #define TRACE_LINE printf("\n\n- Program Statistics :\n1. File : %s\n2. Date : %s\n3. Time : %s\n",__FILE__,__DATE__,__TIME__);
#else
 #define TRACE_LINE
#endif

void InputOutput(int*, const int, const char);
void BucketSort(int*, const int);
void FreeBuffer(int*);

int main(int argc, char *argv[]) {
 system("COLOR 5");
 int *buffer = NULL, max;
 printf("Implementasi Bucket Sort\nMasukkan jumlah data [MAX:100] : ");
 scanf("%d",&max);
 fflush(stdin);
 if((max > 0) && (max <= MAX)) {
  buffer = (int*)calloc(max,sizeof(int));
  InputOutput(buffer,max,INPUT);
  printf("\nData yang anda masukkan : ");
  InputOutput(buffer,max,OUTPUT);
  BucketSort(buffer,max);
  printf("\nData setelah disorting  : ");
  InputOutput(buffer,max,OUTPUT);
  FreeBuffer(buffer);
 }
 TRACE_LINE;
 getch();
 fflush(stdin);
 return(EXIT_SUCCESS);
}

void InputOutput(int* buffer, const int max, const char STAT) {
 int i;
 if('i' == STAT) {
  for(i = 0; i < max; ++i) {
   printf("%d. Data ke-%d : ",(i+1),(i+1));
   scanf("%d",&buffer[i]);
   fflush(stdin);
  }
 } else if('o' == STAT) {
  for(i = 0; i < max; ++i) {
   printf("%d ",buffer[i]);
  }
 }
}

void BucketSort(int* buffer, const int max) {
 int i, j, *count = (int*)calloc(max,sizeof(int));
 for(i = 0; i < max; ++i) {
  count[i] = 0;
 } for(i = 0; i < max; ++i) {
  ++(count[buffer[i]]);
 } for(i = 0, j = 0; i < max; ++i) {
  for(; count[i] > 0; --(count[i])) {
   buffer[j++] = i;
  }
 } FreeBuffer(count);
}

void FreeBuffer(int* buffer) {
 free(buffer);
 buffer = NULL;
}