Question

(C++) Write a function, insertAt, that takes four parameters: an array of integers, the number of elements in the array, an integer (say, insertItem), and an integer (say, index). The function should insert insertItem in the array provided at the position specified by index. If index is out of range, output the following:

 Position of the item to be inserted is out of range

or if the index is negative:

 Position of the item to be inserted must be nonnegative

(Note that index must be between 0 and the number of elements in the array; that is, 0 <= index < the number of elements in the array.) Assume that the array is unsorted.

Answer 1

C++ program :-

#include <iostream>
using namespace std;
  
int* insertAt(int no_of_elements, int arr[],
int insertItem, int index)
{
int i;
  
if(index>no_of_elements){
cout<<" Position of the item to be inserted is out of range"<<endl;
return 0;
}
  
if(index<0){
cout<<"Position of the item to be inserted must be nonnegative"<<endl;
return 0;
}
  
no_of_elements++;
  
//re-arranging the elements and creating space for the inserting element
for (i = no_of_elements; i >= index; i--) {
arr[i] = arr[i - 1];
}
  
//inserting the element at given position
arr[index - 1] = insertItem;
  
return arr;
}
  
int main()
{
int arr[20] = { 0 };
  
for (int i = 0; i < 15; i++)
arr[i] = i + 1;
  
for (int i = 0; i < 15; i++)
cout << arr[i] << " ";
cout << endl;
  
insertAt(20, arr, 200, 12);
  
// new array
cout<<endl<<"The updated array :"<<endl;
for (int i = 0; i < 15 + 1; i++)
cout << arr[i] << " ";
cout << endl;
  
return 0;
}

.

Output :-

► Ex Result CPU Time: 0.00 sec(s), Memory: 3356 kilobyte(s) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 The updated array : 1 2 3 4 5 6 7 8 9 10 11 200 12 13 14 15