//program to sort out an array using selection sort
#include<iostream.h>
#include<conio.h>
void selection_sort(int A[20],int N)
{ int i,j,p,temp,small,pos;
  for(i=0;i<N;i++)
  { small=A[i];
pos=i;
for(j=i+1;j<N;j++)
{ if(small>A[j])
{ small=A[j];
  pos=j;
}
}
temp=A[i];
A[i]=A[pos];
A[pos]=temp;
cout<<"\n Array after iteration "<<(i+1)<<" is: ";
for(p=0;p<N;p++)
cout<<A[p]<<"\t";
  }
}
void main()
{ clrscr();
  int a[20],n,i;
  cout<<"\n Enter the number of elements:";
  cin>>n;
  cout<<"\n Enter the elements of array";
  for(i=0;i<n;i++)
  { cout<<"\n Enter a["<<i<<"]:";
cin>>a[i];
  }
  cout<<"\n Array is:";
  for(i=0;i<n;i++)
  cout<<a[i]<<"\t";
  selection_sort(a,n);
  cout<<"\n Sorted array is:";
  for(i=0;i<n;i++)
  cout<<a[i]<<"\t";
  getch();
}

//program to sort an array using insertion sort
#include<iostream.h>
#include<conio.h>
void insertion_sort(int A[20],int N);
void main()
{ clrscr();
  int a[20],n,i;
  cout<<"\n Enter the number of elements:";
  cin>>n;
  cout<<"\n Enter the elements of array:";
  for(i=0;i<n;i++)
  { cout<<"\n Enter a["<<i<<"]:";
cin>>a[i];
  }
  cout<<"\n Array is:";
  for(i=0;i<n;i++)
  cout<<a[i]<<"\t";
  insertion_sort(a,n);
  cout<<"\n Sorted array is:";
  for(i=0;i<n;i++)
  cout<<a[i]<<"\t";
  getch();
}
void insertion_sort(int A[20],int N)
{ int i,j,temp,p;
  for(i=1;i<N;i++)
  { temp=A[i];
j=i-1;
while(A[j]>temp&&j>=0)
{ A[j+1]=A[j];
j--;
}
A[j+1]=temp;
cout<<"\n Array after itteration "<<i<<" is:";
for(p=0;p<N;p++)
cout<<A[p]<<"\t";
  }
}

//menu driven program to insert or delete a specific element in a sorted array
#include<iostream.h>
#include<conio.h>
#include<process.h>
void insert(int A[20],int& N,int ELEMENT)
{ int pos;
if(N==20)
  { cout<<"\n Overflow";

  }
  if(A[0]>ELEMENT)
  pos=0;
  if(A[N-1]<ELEMENT)
  pos=N;
  for(int i=0;i<N;i++)
  { if(A[i]<ELEMENT&&A[i+1]>ELEMENT)
pos=i+1;
  }
  for(i=N-1;i>=pos;i--)
  A[i+1]=A[i];
  A[pos]=ELEMENT;
  N++;
  cout<<"\n Array after insertion is:";
  for(i=0;i<N;i++)
  cout<<A[i]<<"\t";
}
void delet(int A[20],int N,int ELEMENT)
{ int pos;
if(N==0)
  { cout<<"\n Underflow";

  }
  else
 {  for(int i=0;i<N;i++)
{ if(A[i]==ELEMENT)
pos=i;
}
for(i=pos;i<N;i++)
A[i]=A[i+1];
N--;
cout<<"\n Array after deletion is:";
for(i=0;i<N;i++)
cout<<A[i]<<"\t";
 }
}
void main()
{ clrscr();
  int a[20],n=0,element,p;
  l:

  cout<<"\n Press 1 for INSRETION"
<<"\n Press 2 for DELETION"
<<"\n Press 3 for EXIT\n";

  cout<<"\n Enter your choice:";
  cin>>p;
  if(p==3)
  { clrscr();
cout<<"\n\t\t THANK YOU";
getch();
exit(0);
  }
  else if(p==1)
  { clrscr();

cout<<"\n Enter the element to be inserted:";
cin>>element;
insert(a,n,element);
goto l;

  }
  else
  { clrscr();

cout<<"\n Enter the element to be deleted:";
cin>>element;
delet(a,n,element);
goto l;

  }
  getch();
}

//progarm to search an integer in an array of N integers using linear search
#include<iostream.h>
#include<conio.h>
int linear(int A[],int N,int ELEMENT)
{ for(int i=0;i<N;i++)
  { if(A[i]==ELEMENT)
return i;
  }
  return(-1);
}
void main()
{ clrscr();
  int a[20],n,element,i,p;
  cout<<"\n Enter the number of elements";
  cin>>n;
  cout<<"\n Enter the elements of array";
  for(i=0;i<n;i++)
  { cout<<"\n Enter a["<<i<<"]:";
cin>>a[i];
  }
  cout<<"\n Array is:";
  for(i=0;i<n;i++)
  cout<<a[i]<<"\t";
  cout<<"\n Enter the element to be searched:";
  cin>>element;
  p=linear(a,n,element);
  if(p==-1)
  cout<<"\n Unsucessful search";
  else
  cout<<"\n Element "<<element<<" is present at index "<<p<<" and at position "<<(p+1);
  getch();
}