#include "analitic_tools.h"
#include <stdio.h> 

void insertionSort(char v[], int n)
{
	INT i, j;
	char chave;
	for(j=1; j<n; j++) 
	{
		chave = v[j];
		i = j-1;
		while(i >= 0 && v[i] > chave)
		{
			v[i+1] = v[i];
			i--;
		}
		v[i+1] = chave;
	}
}


char median(char buf[], INT tam){
	INT m,a,b,n;
	n=tam;
	/* ordena */
	insertionSort(buf, tam);
	/*faz mediana*/
	if(tam % 2 !=0){
		a = buf[n/2];
		b = buf[(n+1)/2];
		m = (a+b)/2;
	}
	else
		m = buf[n/2];
		
	return m;
}