C++冒泡排序

class BubbleSort {
public:
    BubbleSort(){}
    virtual ~BubbleSort(){}

//从大到小
    static void sortn_0(int *src, int size){
        int t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] < src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
    
    static void sortn_0(double *src, int size){
        double t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] < src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
    
    static void sortn_0(float *src, int size){
        float t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] < src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
    
    //从小到大
    static void sort0_n(int *src, int size){
        int t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] > src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
    
    static void sort0_n(double *src, int size){
        double t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] > src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
    
    static void sort0_n(float *src, int size){
        float t;
        for(int i = 0; i < size-1; i++){
            for(int j = 0; j < size-1; j++){
                if(src[j] > src[j+1]){
                    t = src[j];
                    src[j] = src[j+1];
                    src[j+1] = t;
                }
            }
        }
    }
};

int main(int argc, char** argv) {
    int a[100], n;
    
    cout << "请输入排序数字的个数" << endl;
    cin >> n;
    cout << "请依次输入排序的数字" << endl;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    BubbleSort::sortn_0(a, n);
    for(int j = 0; j < n; j++)
        cout << a[j] << " ";
    return 0;
}

运行结果