Write a c programm of insertion of element in the array?

Answer 1

#include<stdio.h>

#include<conio.h>

void main()

{

int a[20],i,j,n;

clrscr();

printf("Enter the no of element you want to insert in the array : ");

scanf("%d",&n);

printf(" Enter the Array element : ");

for(i=0;i<n;i++)

{

scanf("%d",&a[i]);

}

printf("The array is : ");

for(i=0;i<n;i++)

{

printf("%d",a[i]);

}

printf(" Enter the element which you want to insert");

scanf("%d",&j);

printf("The array is : ");

for(i=0;i<n+1;i++)

{

if(i==n)

a[i]=j;

printf("%d",a[i]);

}

getch();

}

Answer 2

#include<iostream.h> #include<conio.h> void main() { clrscr(); int stack[100],loc,top,item,max=100; cout<<"\n------ Stack Insertion using Array ------"; cout<<"\n\nEnter Value of Stack Top : "; cin>>top; if(top>=max) { cout<<"\nStack is Full"; getch(); return; } cout<<"\nEnter Elements in Stack :\n"; for(loc=1;loc<=top;loc++) { cin>>stack[loc]; } ins: cout<<"\nEnter Item you want to Insert : "; cin>>item; top=top+1; //Increment the Top stack[top]=item; //Insert Element cout<<"\nStack After Insertion :\n"; for(loc=1;loc<=top;loc++) { cout<<stack[loc]<<endl; } cout<<"\nTop : "<<top; cout<<"\n\nItem "<<item<<" is Inserted at Top\n\n"; cout<<"\n\nWant to Insert more elements ?????\n\n"; cout<<" -----> Press 1 to Continue\n"; cout<<" -----> Press any Key to Exit\n"; char choice; cin>>choice; if(choice=='1' && top<max) { cout<<endl<<endl; goto ins; } else if(choice=='1' && top>=max) { cout<<"\nStack is Full"; getch(); return; } else { return; } }

Output :-

Answer 3

In C, you have to move elements to make pace:

Insert (int into[], int at, int *used, int value)
{
if (at>*used) exit (33);
if (at<*used) memmove (&into[at+1], &into[at], (*used-at)*sizeof(into[0])));
into[at]= value;
++*used;

}

int main (void)
{
int a[32];
int an;
int i;

an= 0;
Insert (a, 0, &an, 3);
Insert (a, 0, &an, 1);
Insert (a, 1, &an, 2);
for (i=0; iprintf ("\n");
return 0;

}
...........................................................................................................................................
Rjames007:-
Hi I read the program and it's short so it is good but there is an another method it looks larger but it is so simple , here we go:


#include
#include
int a[30],i,pos,num,len;
void main()
{
void insert(int a[],int);
clrscr();
printf("the length of array is=");
scanf("%d",& len);
printf("the elements of array are=");
for(i=0;iscanf("%d", & a[i]);
printf("the array is=");
for(i=0;iprintf("%d", a[i]);


insert(a,len);
getch();
}
void insert(int a[],int len)
{
printf("the number which is to be inserted is=");
scanf("%d",& num);
printf("the position at which no. is going to be inserted=");
scanf("%d", & pos);
--pos;


if pos{
for(i=len;i>=pos;i--)
a[i+1]=a[i];
a[pos]=num;
len++;
}
else
printf("\n outside the array");


printf("the new array is=");
for(i=0;iprintf("%d", a[i]);
}

Answer 4

hi, after you declare the array, you simply do as follows:

int i[10];

i[4] = 4;

this would declare an array called i of type int with 10 spaces. the fith space (space 4 because we count 0 as the first) would be set to "4" in the above example

Lewis

www.bastmonitoring.com

Answer 5

In Java, this is a three step process.

1. Find the correct position for the element. Arrays.binarySearch(array, element) will find the correct position for the element. It returns one of two things: a positive number if the element already exists in the array, or a negative number that represents where it should be placed in the array. Quick example: Arrays.binarySearch(new double[]{1,2,3},2) = 1, Arrays.binarySearch(new double[]{1,2,3},2.5) = -3 (element's correct position-1).
2. Shift the array to insert the element. This can be done with a simple for loop: for(int i=insert_position; i
3. Insert the element. Assign the element to its new position. arr[insert_position] = element.

Answer 6

Before you can insert an element into an array you must first make space for the new element. In other words, you must reallocate the array. If there is insufficient memory in which to grow the array, the array must be copied to new memory. Thus if you plan on performing many insertions, it pays to reserve memory in advance. This also means you must keep track of how many elements are available in the reserve. When the reserve runs out, you must reallocate.

Assuming you have at least one unused element at the end of your array, you can then determine where the insertion point will be. Assuming the array is in sorted order, you can use the insertion sort algorithm, working backwards through the array, moving elements forward until the new element finds its place.

Answer 7

To begin, obtain the element to be added, such as x.

Then, say pos, get the position where this element will be put.

Then shift the array items one position ahead, then do the same for all the other elements next to pos.

Because the location pos is now empty, insert the element x there.

To learn more about data science please visit- Learnbay.co