/prog/ - FUCK YEAH BUBBLE SORT

Name: Anonymous 2008-07-09 1:39



inline void swap_bytes(void *a, void *b, size_t size)

{

    char *a_char = a, *b_char = b, temp;



    while(size--) {

        temp      = *a_char;

        *a_char++ = *b_char;

        *b_char++ = temp;

    }

}



void bubble_sort(void *base, size_t num, size_t size, int (*comparator)(const void *, const void *))

{

    void *first, *second;

    size_t pass, passes = num - 1, i;

    int result;



    if(num > 1) {

        for(pass = 0; pass < passes; ++pass) {

            second = base + size * num - size;

            first  = second - size;



            for(i = num; i > pass + 1; --i) {

                result = comparator(first, second);

                if(result == 1)

                    swap_bytes(first, second, size);

                first -= size;

                second -= size;

            }

        }

    }

}

Here you go, /prog/, a generic implementation of bubble sort that can replace qsort().

Name: Anonymous 2008-07-09 6:09

void sort(void *base, size_t num, size_t size, const uintmax_t (*sortvalue)(const void *)){

 void *temp = calloc(num, size);

 char *lists[2] = {(char *)base, (char *)temp};

 for(uint_fast8_t i = 0; i < sizeof(uintmax_t) * CHAR_BIT; ++i)

  for(size_t j = 0, start = 0, end = num - 1; j < num; ++j){

   if(!(sortvalue(arrays[i & 1] + j * size) & 1 << i))

    memcpy(arrays[i & 1 ^ 1] + start++ * size, arrays[i & 1] + j * size, size);

   if(arrays[i & 1] + (num - j - 1) * size & 1 << i)

    memcpy(arrays[i & 1 ^ 1] + end-- * size, arrays[i & 1] + (length - j - 1) * size, size);

}}

FUCK YEAH BUBBLE SORT

1 Name: Anonymous 2008-07-09 1:39

4 Name: Anonymous 2008-07-09 6:09

Name: Anonymous 2008-07-09 1:39

Name: Anonymous 2008-07-09 6:09