//Deletion in a 1D sorted array
#include<iostream.h>
#include<conio.h>
main()
{
int a[50];
int i,n,k,flag=0,item;
cout<<"Enter No of elements in array";
cin>>n;
cout<<"Enter elements in accending";
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<"Enter Element to Delete";
cin>>item;
for(i=1;i<=n;i++)
{
if(item<a[i])
{
for(k=i;k<=n;k++)
{a[k-1]=a[k];}
n=n-1;
flag=1;
break;
}
}
if(flag!=1)
cout<<"Item Not Found";
else
{
for(i=1;i<=n;i++)
cout<<a[i]<<endl;
}
getch();
}
#include<iostream.h>
#include<conio.h>
main()
{
int a[50];
int i,n,k,flag=0,item;
cout<<"Enter No of elements in array";
cin>>n;
cout<<"Enter elements in accending";
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<"Enter Element to Delete";
cin>>item;
for(i=1;i<=n;i++)
{
if(item<a[i])
{
for(k=i;k<=n;k++)
{a[k-1]=a[k];}
n=n-1;
flag=1;
break;
}
}
if(flag!=1)
cout<<"Item Not Found";
else
{
for(i=1;i<=n;i++)
cout<<a[i]<<endl;
}
getch();
}
No comments:
Post a Comment