常见几种排序

冒泡排序:　

struct Array {
    int * pBase;
    int length;
    int current;
};

void sort_array(struct Array * pArray) {
    
    int i, j, t;
    
    for (i = 0; i < pArray->current; i++) {
        
        for (j = i+1; j < pArray->current; j++) {
            
            if (pArray->pBase[i] > pArray->pBase[j]) {
                t = pArray->pBase[i];
                pArray->pBase[i] = pArray->pBase[j];
                pArray->pBase[j] = t;
            }
        }
    }
    
}