3.C++实现：数组排序

void test(){
    int lateralcontrolbuffer_index1_ = 0;
    double lateralcontrolbuffer1_[5] = {0.0};
    for(int i = 0; i < 5; i++){
       srand((unsigned int)time(NULL) + i);
       lateralcontrolbuffer1_[i] = rand() % 100;
    }
    cout << "before sorting:" << endl;
    for(auto i : lateralcontrolbuffer1_){
        cout << i << endl;
    }
    for(int i = 0; i < 5; i++){
        for(int j = 1; j < 5 - i; j++){
            if(lateralcontrolbuffer1_[j] < lateralcontrolbuffer1_[j - 1]){
                double tmp = lateralcontrolbuffer1_[j - 1];
                lateralcontrolbuffer1_[j - 1] = lateralcontrolbuffer1_[j];
                lateralcontrolbuffer1_[j] = tmp;
            }
        }
    }
    cout << "after sorting:" << endl;
    for(auto i : lateralcontrolbuffer1_){
        cout << i << endl;
    }
}

测试结果：