heapsort1 heapsort int heapsort(void *vbase, size_t nmemb, size_t size, int (*compar)(const void *, const void *)) #include #include #include /* * Swap two areas of size number of bytes. Although qsort(3) permits random * blocks of memory to be sorted, sorting pointers is almost certainly the * common case (and, were it not, could easily be made so). Regardless, it * isn't worth optimizing; the SWAP's get sped up .. 2016. 7. 9. 이전 1 다음