Pages

May 21, 2012

wap in c++ to insert an element in an array.


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[10];
int i,j,n,loc,item;
cout<<"\nEnter the no. of element\t";
cin>>n;
cout<<"\nEnter the element in array\n";
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<"\nEnter the location on which to insert\t";
cin>>loc;
cout<<"\nenter the element to insert\t";
cin>>item;


for(j=n-1;j>=loc;j--)
{
a[j+1]=a[j];
}
a[loc]=item;
n=n+1;
cout<<"\nModified array is\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}
getch();
}

wap in c++ to delete an element from an array.


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[10];
int i,j,n,loc,item;
cout<<"\nEnter the no. of element\t";
cin>>n;
cout<<"\nEnter the element in array\n";
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<"\nEnter the location from where to delete\t";
cin>>loc;
item=a[loc];


for(j=loc;j<n-1;j++)
{
a[j]=a[j+1];
}
n=n-1;
cout<<"\nDeleted element is\t"<<item<<endl;
cout<<"\nModified array is\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}
getch();
}

May 8, 2012

wap in c++ to do bubble sort.


#include<iostream.h>
#include<conio.h>


void main()
{
clrscr();
int a[10],n,i,j;
cout<<"\nNo of element in array\t";
cin>>n;
cout<<"enter the element\n";
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j]>a[j+1])
{
int t;
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
cout<<"\nSorted array is\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}
getch();
}

wap in c++ for binary search.



#include<iostream.h>
#include<conio.h>


void main()
{
clrscr();
int a[10],n,beg,end,mid,item;
cout<<"\nNo of element in array\t";
cin>>n;
cout<<"enter the element\n";
for(int i=0;i<n;i++)
{
cin>>a[i];
}
cout<<"\nenter item to be searched\t";
cin>>item;
beg=0;end=n;
mid=(beg+end)/2;
while(beg<=end&&a[mid]!=item)
{
if(item<a[mid])
{
end=mid-1;
}
else
{
beg=mid+1;
}
mid=(beg+end)/2;
}
if(a[mid]==item)
{
cout<<"\nitem found at loc "<<mid+1;
}
else
{
cout<<"\nitem not found";
}
getch();
}