algorithm.temp.h

Go to the documentation of this file.

#ifndef CTL_ALGORITHM_TEMP_H
#define CTL_ALGORITHM_TEMP_H

#define ctl_array_qsort_implement(type)\
ctl_array_qsort_declare(type)\
{\
    if ( high > low )\
    {\
        type* scanlow = low;\
        type* scanhigh = high;\
        {\
            type* middle = low + ((high - low)>>1);\
            while( scanlow <= scanhigh )\
            {\
                while( ( scanlow < high ) && ( compare( scanlow, middle ) < 0 ) )\
                    ++scanlow;\
                while( ( scanhigh > low ) && ( compare( scanhigh, middle ) > 0 ) )\
                    --scanhigh;\
                if( scanlow <= scanhigh ) \
                {\
                    ppConcat( type,_swap )( scanlow, scanhigh );\
                    if( middle == scanlow  )\
                        middle = scanhigh;\
                    else if( middle == scanhigh )\
                        middle = scanlow;\
                    ++scanlow;\
                    --scanhigh;\
                }\
            }\
        }\
        if( low < scanhigh )\
            ppConcat(type,_array_qsort)( low, scanhigh, compare );\
        if( scanlow < high )\
            ppConcat(type,_array_qsort)( scanlow, high, compare );\
    }\
}

#define ctl_array_bsort_implement(type)\
ctl_array_bsort_declare(type)\
{\
    bool bSwap;\
    do\
    {\
        bSwap = false;\
        while( low < high )\
        {\
            if( compare( low,low+1 ) > 0 )\
            {\
                ppConcat( type,_swap )( low,low+1 );\
                bSwap = true;\
            }\
            low++;\
        }\
    } while( bSwap );\
}


#endif /* CTL_ALGORITHM_TEMP_H */