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

void insertionSort(int *vetor, int lenght)
{
    int i,j,atual;
    for(i=0; i<lenght; i++)
    {
        atual = vetor[i];
        j = i-1;

        while((j>=0)&&(atual<vetor[j]))
        {
            vetor[j + 1] = vetor[j];
            j = j-1;
        }
        vetor[j+1] = atual;
    }
}

int Bucket(float *vetor,int n)
{
    int i,j,indice,*D,rea = 10;
    float **B;
    B = (float**) malloc(n*sizeof(float*));

    for(i=0;i<n;i++)
    {
        B[i] =(float*) calloc(10,sizeof(float));
    }

    for(i=0;i<n;i++)
    {
        j = vetor[i]*n;
        B[j][0]++;
        if(B[j][0]>rea)
        {
            //B[j] = (float*) realloc(B[j],sizeof(float));
            //rea+=10;
            printf("\n\n\n\n\n\n\n\n FO \t DE \t O \n\n\n\n\n\n");
            scanf("ola: %d",&i);
        }
        indice = (int)B[j][0];
        B[j][indice] = vetor[i];

    }

    for(i=0;i<n;i++)
    {
        indice = B[i][0];
        for(j=0;j<indice;j++)
        {
            vetor[i]=B[i][j+1];
        }
    }
    return 1;

}


int main()
{
    int n=150;
    float *vetor;
    vetor = (float*) malloc(sizeof(float)*n);
    int i;

    for(i=n-1;i>=0;i--){

        vetor[i] =  (float)i/n;
    }

    Bucket(vetor,n);


    for(i=0;i<n;i++)
        printf("%f\n",vetor[i]);

    return 1;
}