Linear table insert, delete, query operation

2019 Unicorn Enterprises heavily recruiting engineers Python standard >>>

int find(int value){
for(int i=0;i<currentP;++i){
   if(arrayOfNum[i]==value)
    return i;
}
return -1;
}

void insert(int index){
int num;
if(index<0||index>currentP)
   cout<<"position illeagle!\n";
else{
   for(int i=currentP;i>index;i--){
    arrayOfNum[i]=arrayOfNum[i-1];
   }
   printf("input insert number\n");
   cin>>num;
   arrayOfNum[i]=num;
   currentP++;
}
}

void deleteP(int index)
{
if(index>currentP||index<0)
   cout<<"delete Point illeagle!";
else
{
   for(int i=index;i<currentP;i++){
    arrayOfNum[i]=arrayOfNum[i+1];
   }
   currentP--;
}

}

void procInitial()
{
currentP=0;
cin>>n;
for(int i=0;i<n;i++){
   scanf("%d",&arrayOfNum[i]);
   currentP++;
}
}

 

Reproduced in: https: //my.oschina.net/u/1167421/blog/546458