подпрограмма для универсальной сортировки - C++ - Ответ 1932840

// ANSI C 99
 
#include <stdio.h>
#include <string.h>
 
#define swap(a, b, size) ({ unsigned char tmp[(size)]; memcpy(tmp, (a), (size)); memcpy((a), (b), (size)); memcpy((b), tmp, (size)); })
 
void mysort(void * arr, size_t count, size_t size, int (*func)(const void *, const void *)){
    void * pArr, * pCurrent, * pFirst;
    
    for ( pArr = arr; pArr < ( arr + (count - 1) * size ); pArr += size ){
        pFirst = pArr;
        for ( pCurrent = pArr + size; pCurrent < ( arr + count * size ); pCurrent += size )
            if ( func(pFirst, pCurrent) > 0 )
                pFirst = pCurrent;
        if ( pFirst != pArr )
            swap(pArr, pFirst, size);
    }
}
 
int cmp_char_ascendant(const void * a, const void * b){
    return *(char*)a - *(char*)b;
}
 
int cmp_char_descendant(const void * a, const void * b){
    return cmp_char_ascendant(b, a);
}
 
int cmp_int_ascendant(const void * a, const void * b){
    return *(int*)a - *(int*)b;
}
 
int cmp_int_descendant(const void * a, const void * b){
    return cmp_int_ascendant(b, a);
}
 
int cmp_double_ascendant(const void * a, const void * b){
    double diff = *(double*)a - *(double*)b;
    return ( diff < 0.0 ) ? -1 : ( diff > 0.0 ) ? 1 : 0;
}
 
int cmp_double_descendant(const void * a, const void * b){
    return cmp_double_ascendant(b, a);
}
 
#define SIZE 5
 
int main(void){
    char cArr[SIZE] = { 'b', 'd', 'a', 'c', 'e' };
    int iArr[SIZE] = { 3, 1, 2, 5, 4 };
    double dArr[SIZE] = { 2.0, 3.1, 4.4, 1.8, 5.4 };
    
    int i;
    
    printf("Char unsorted:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%c ", cArr[i]);
    printf("\n");
    
    mysort(cArr, SIZE, sizeof(char), cmp_char_ascendant);
    printf("Char sorted ascendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%c ", cArr[i]);
    printf("\n");
    
    mysort(cArr, SIZE, sizeof(char), cmp_char_descendant);
    printf("Char sorted descendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%c ", cArr[i]);
    printf("\n");
    
    printf("Int unsorted:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%d ", iArr[i]);
    printf("\n");
    
    mysort(iArr, SIZE, sizeof(int), cmp_int_ascendant);
    printf("Int sorted ascendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%d ", iArr[i]);
    printf("\n");
    
    mysort(iArr, SIZE, sizeof(int), cmp_int_descendant);
    printf("Int sorted descendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%d ", iArr[i]);
    printf("\n");
    
    printf("Double unsorted:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%.1f ", dArr[i]);
    printf("\n");
    
    mysort(dArr, SIZE, sizeof(double), cmp_double_ascendant);
    printf("Double sorted ascendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%.1f ", dArr[i]);
    printf("\n");
    
    mysort(dArr, SIZE, sizeof(double), cmp_double_descendant);
    printf("Double sorted descendant:\n");
    for ( i = 0; i < SIZE; ++i )
        printf("%.1f ", dArr[i]);
    printf("\n");
    
    return 0;
}