for(i=n-1; i>=P-1; i--)
a[i+1] = a[i];
a[P-1] = PE;
for(i=0; i<=n; i++)
printf("%d ", a[i]);
Input: 5
Input: 10 20 30 40 50
Input P = 3
Input PE = 11
Output: 10 20 11 30 40 50
The code snippet shown is a logic for inserting an element into an array at a specified position.
The input array has a size of 5 and contains the elements 10, 20, 30, 40, and 50. The program prompts for the position (P) at which the new element (PE) should be inserted. In this case, P is set to 3, and PE is set to 11.
The logic starts with a for loop that iterates from n-1 (the last index of the array) to P-1. This loop is used to shift the existing elements to the right to create space for the new element. Within the loop, each element is moved one position to the right by assigning the value of a[i] to a[i+1].
Once the shifting is complete, the new element (PE) is inserted at position P-1 by assigning its value to a[P-1].
After the insertion, there is another for loop that iterates from 0 to n. This loop is used to print the updated array elements. Each element is printed using the printf function with the format specifier %d followed by a space.
The output, as expected, is 10 20 11 30 40 50, where the element 11 has been inserted at the 3rd position.
#coding #arrayinsertion #algorithm #AbdurRahimRatulAliKhan
