C++ program for this algo

Try this:

#include

using namespace std;

void INSERT(int LA[],int& N,int K, int ITEM)

{

/* Note that arrays in C++ are zero based so initial value of J is N - 1 not N */

for(int j = N - 1; j >= K; j--)

{

LA[j + 1] = LA[j];

}

LA[K] = ITEM;

N++; // N passed by reference so new value will be persisted to calling code

}

int main()

{

const int size = 4; // initial size of array

int LA[size + 1]; // make this one bigger to allow an insertion

LA[0] = 1;

LA[1] = 2;

LA[2] = 4;

LA[3] = 5;

int N = size;

int K = 2; // insert at index 2 say

int ITEM = 3;

INSERT(LA, N, K, ITEM);

/* check it worked */

for(int i = 0; i < N ; i++) cout << LA[i] << endl;

return 0;

}

The output is:

1
2
3
4
5