void h_adjust(void *base, uint elemsize, uint begin, uint end, compare_func cmp)
{
uint j;
void * ex = malloc(elemsize);
memcpy(ex, base+begin*elemsize, elemsize);
for(j = 2*begin+1; j <= end; j=2*j+1)
{
if(j=0)
break;
memcpy(base+begin*elemsize, base+j*elemsize, elemsize);
begin = j;
}
memcpy(base+begin*elemsize, ex, elemsize);
free(ex);
}
void hsort(void *base, uint nmemb, uint size, compare_func func)
{
int i;
//nmemb total count;
//mine: the last index;
void *ex = malloc(size);
--nmemb;
for(i = (nmemb-1)/2; i>=0; --i)
h_adjust(base, size, i, nmemb, func);
for(i = nmemb; i > 0; --i)
{
memcpy(ex, base, size);
memcpy(base, base+i*size, size);
memcpy(base+i*size, ex, size);
h_adjust(base, size, 0, i-1, func);
}
free(ex);
}
david feng的不常更新的博客
最近在玩Haskell...工作太忙,自由时间太少...
评论 (0)
Host by is-Programmer.com | Power by Chito 1.3.3 beta | Theme: Aeros 2.0 by TheBuckmaker.com