25 In differential aeration corrosion, rich oxygenated parts are
1 answer:
You might be interested in
Answer:
Check the explanation
Explanation:
#include <iostream>
using namespace std;
void insert(int* arr, int* size, int value, int position){
if(position<0 || position>=*size){
cout<<"position is greater than size of the array"<<endl;
return ;
}
*size = *size + 1 ;
for(int i=*size;i>position;i--){
arr[i] = arr[i-1];
}
arr[position] = value ;
}
void print(int arr[], int size){
for(int i=0;i<size;i++){
cout<< arr[i] <<" ";
}
cout<<" "<<endl;
}
void remove(int* arr, int* size, int position){
* size = * size - 1 ;
for(int i=position;i<*size;i++){
arr[i] = arr[i+1];
}
}
int count(int arr[], int size, int target){
int total = 0 ;
for(int i=0;i<size;i++){
if(arr[i] == target)
total += 1 ;
}
return total ;
}
int main()
{
int size;
cout<<"Enter the initial size of the array:";
cin>>size;
int arr[size],val;
cout<<"Enter the values to fill the array:"<<endl;
for(int i=0;i<size;i++){
cin>>val;
arr[i] = val ;
}
int choice = 5,value,position,target ;
do{
cout<<"Make a selection:"<<endl;
cout<<"1) Insert"<<endl;
cout<<"2) Remove"<<endl;
cout<<"3) Count"<<endl;
cout<<"4) Print"<<endl;
cout<<"5) Exit"<<endl;
cout<<"Choice:";
cin>>choice;
switch(choice){
case 1:
cout << "Enter the value:";
cin>>value;
cout << "Enter the position:";
cin>>position;
insert(arr,&size,value,position);
break;
case 2:
cout << "Enter the position:";
cin>>position;
remove(arr,&size,position);
break;
case 3:
cout<<"Enter the target value:";
cin>>target;
cout <<"The number of times "<<target<<" occured in your array is:" <<count(arr,size,target)<<endl;
break;
case 4:
print(arr,size);
break;
case 5:
cout <<"Thank you..."<<endl;
break;
default:
cout << "Invalid choice..."<<endl;
}
}while(choice!=5);
return 0;
}
Kindly check the attached images below for the code output.
