c++学习随笔之数组的插入删除

1. 数组的插入 找到要插入的位置 大于它或者小于它的数值的向后移一位或者向前加一位
2. 数组的删除 找到删除的位置 后面的数字向前移位

#include <iostream>
using namespace std;

int main()
{
    double power[99];
    int powerCount = 0;
    double insertPower;
    int insertIndex = 0;
    power[powerCount++] =45771;
    power[powerCount++] =42322;
    power[powerCount++] =40907;
    power[powerCount++] =40706;


    double temp;

    for(int i=0;i<powerCount;i++){
       for(int j=0;j<powerCount -i -1;i++){
            if(power[j]< power[j+1]){
                    temp= power[j];
                    power[j]=power[j+1];
                    power[j+1]=temp;
            }
       }
    }

    cout << "排序后" << endl;

    for(int i=0;i<powerCount;i++){
        cout << power[i] << "\t";

    }
    cout << endl;
    cout << "请输入要插入的数字" << endl;

    cin >> insertPower;

    insertIndex=powerCount;

    //1.找到第一个比插入数字大的下标位置
    for(int i=0;i<powerCount;i++){
        if(insertPower > power[i]){
            insertIndex = i;
            break;
        }

    }


    //2.从最后一个元素开始,将数字复制到后一个元素中
    for(int i = powerCount -1; i >= insertIndex ;i-- ){
        power[i+1]=power[i];
    }

    power[insertIndex]=insertPower;
    powerCount++;

    for(int i=0;i<powerCount;i++){
        cout << power[i] << "\t";

    }

    double deletePower;
    int deleteIndex = -1;

    cout << "请输入删除的数字" <<  endl;

    cin >> deletePower;


    for(int i=0;i<powerCount;i++){
        if(deletePower==power[i]){
            deleteIndex=i;
        }
    }

    //前移一位
    for(int i=deleteIndex;i<powerCount-1;i++){
        power[i]=power[i+1];
    }
    powerCount--;

    cout << "删除后" << endl;


    for(int i=0;i<powerCount;i++){
        cout << power[i] << "\t";
    }


    return 0;
}