write a program to insert an element into an array
Answer Posted / renuka
#include<stdio.h>
#include<conio.h>
void insert(int b[],int n,int pos,int item);
void main()
{
int a[6]={10,20,30,40,50},p,c,item;
printf("enter item and position for insertion");
scanf("%d%d",&item,&p);
printf("array before insertion");
for(c=0;c<=4;c++)
{
printf("%d\n",a[c]);
}
insert(a,6,p,item);
printf("array after insertion");
for(c=0;c<=5;c++)
{
printf("%d\n",a[c]);
}
getch();
}
void(int b[],int n,int pos,int item)
{
int c;
c=n-1;
while(c>pos)
{
b[c]=b[c-1];
c--;
}
b[c]=item;
}
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
What is virtual table?
What are references in c++?
What is setf in c++?
Can malloc be used in c++?
What are c++ files?
What is the difference between function overloading and operator overloading?
Does c++ cost money?
What is the use of ::(scope resolution operator)?
What is split a string in c++?
what are the decision making statements in C++? Explain if statement with an example?
Why c++ is better than c language?
Give the difference between the type casting and automatic type conversion. Also tell a suitable C++ code to illustrate both.
Write a program to encrypt the data in a way that inputs a four digit number and replace each digit by (the sum of that digit plus 7) modulus 10. Then sweep the first digit with the third, second digit with the fourth and print the encrypted number.
Assume an array of structure is in order by studentID field of the record, where student IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to find the record with a specific studentID if every single student ID from 101 to 500 is used and the array has 400 elements. Write the most efficient pseudocode algorithm you can to find a record with a studentID near the end of the IDs, say in the range from 450 to 500, if not every single student ID in the range of 101 to 500 is used and the array size is only 300
How many types of modularization are there in c++?