sorting Algorithms

/*

By Seregamil

gnomeSort(_array[], size = sizeof _array)
bubbleSort(_array[], size = sizeof _array)
selectionSort(_array[], size = sizeof _array) - very fast

*/
#include a_samp

main(){}

new array[] = {
    435,52,6234,463,73,4,2,43,52,64,1,24,64,13
};

public OnGameModeInit(){
    selectionSort(array);
    //or gnomeSort(array);
    //or bubbleSort(array);
    return 1;
}

gnomeSort(_array[], size = sizeof _array){
    for( new j = 1, swap; j != size;  ){
        if(_array[ j - 1 ] >= _array[ j ]) ++ j;//max to min
        else{
            swap = _array[ j ];
            _array[ j ] = _array[ j - 1 ];
            _array[ j - 1 ] = swap ;
            -- j;

            if( j == 0)
                j = 1;
        }
    }
}

bubbleSort(_array[], size = sizeof _array){
    for(new i = 0, j = 0, swap = 0; i != size; i++) {
        for( j = 0 ; j < i ; j++ ) {
            if(_array[i] > _array[j]){//max to min
                swap = _array[i];
                _array[i] = _array[j];
                _array[j] = swap;
            }
        }
    }
}

selectionSort(_array[], size = sizeof _array){
    for(new i = 0, minimal = 0, j = 0, swap = 0; i != size - 1; i++){
        minimal = i;
        for(j = i + 1; j != size; j++){
            if(_array[ j ] > _array[ minimal ])//max to min
                minimal = j;
        }
        if(minimal != i){
            swap = _array[ i ];
            _array[ i ] = _array[ minimal ];
            _array[ minimal ] = swap;
        }
    }
}