insertion sort in C++

#include<stdio.h>
int main(){

  int m,n,s,temp,a[20];

  printf("Enter how many elements you want to sort? ");
  printf ("\n\n");
  scanf("%d",&s);

  printf("Enter that %d elements: ",s);
  printf ("\n");
  for(m=0;m<s;m++)
      scanf("%d",&a[m]);

  for(m=1;m<s;m++){
      temp=a[m];
      n=m-1;
      while((temp<a[n])&&(n>=0)){
      a[n+1]=a[n];
          n=n-1;
      }
      a[n+1]=temp;
  }

  printf("The elements are sorted : ");
  for(m=0;m<s;m++)
      printf(" %d\n\n",a[m]);

  return 0;
}

C++ Code For Linear Search

#include<iostream.h>

class searching
{
private:
double *array;
int n;
public:
void input();
void linearsearch();
};

void searching::input()
{
cout<<”*********************************…
<<”This program is to implement linear search algorithm\n”
<<”*************************************…
cout<<”Enter how many numbers you are going to enter::”;
cin>>n;
array=new double[n+1];
cout<<”Now enter your elements ::\n”;
for(int i=1;i<=n;i++)
cin>>array[i];
}

void searching::linearsearch()
{
cout<<”Enter the number to be searched ::”;
double x;
cin>>x;
int i;
for(i=1;i<=n;i++)
{
if(array[i]==x)
{
cout<<”found at position ::”<<i<<endl;
break;
}
}
if(i>n)
cout<<”Not found\n”;
}

int main()
{
searching obj;
obj.input();
obj.linearsearch();
return 0;
}

C++ Code For Binary Search

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

void main()
{
clrscr();
int l_v=1;
int h_v;
int a[51];
int middle;
int num,i=0;
cout<<"Input your sorted num :
";
while(scanf("%d",&a[i])!=EOF)
i++;
h_v=i;
cout<<"
The input numbers are :
";
i=0;
while(i<h_v)
{
cout<<a[i]<<endl;
i++;
}
getch();
cout<<"

Input your searching number :
";
cin>>num;
for(int n=0;a[middle]!=num;n++)
{
middle = (l_v + h_v)/2;
if(a[middle]>num)
h_v = middle - 1;
else if(a[middle]<num)
l_v = middle + 1;
else if(a[middle]==num)
cout<<"
Found your number in "<<middle+1<<" position.";
}
cout<<"

This program's loop is executed "<<n<<" times to find out
the
number.";
getch();
}