Binary Search

#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int search[50],num,left,right,middle,item;
cout<<"Enter number of elements : ";
cin>>num;
cout<<"\nEnter Elements in SORTED ORDER: ";
for(int i=1;i<=num;i++)
{
cin>>search[i];
cout<<"\t\t\t\t";
}
cout<<"\nEnter Item you want to search : ";
cin>>item;
left=1;
right=num;
if(item<search[left] || item>search[right])
{
cout<<"Item not found.";
return 0;
}
middle=(left+right)/2;                    
while(left<=right && search[middle]!=item)  
{
if(search[middle]<item)
left=middle+1;
else
right=middle-1;
middle=(left+right)/2;
}
if(search[middle]==item)
{
cout<<"\n"<<item<<" is Found at location : "<<middle;
}
else
{
cout<<"Item is not found";
}

getch();
return 0;
}